Data analysis using a geometrical representation of predicate calculus
Predicate calculus over the attribute space as a basis for database analysis and design is considered. Geometric representations for predicate differences are given in an n-dimensional space providing a tabular method to decompose queries. The approach is in close connection with the concepts of ``infospatial derivative and ``projection-solid infospatial approach suggested by the same author in 1983. The paper is part of the work carried out in the project FDB (Formal Data Base). Extensions to expert system applications are also given here.
- ℵ_0-categoricity of linear orderings
- Algebraic theory of brick packing. II
- An upper bound on the number of execution nodes for a distributed join
- Boolean calculus of differences
- Dynamic multi-dimensional data structures based on quad- and k-d trees
- scientific article; zbMATH DE number 3831909 (Why is no real title available?)
- scientific article; zbMATH DE number 3831938 (Why is no real title available?)
- scientific article; zbMATH DE number 3837413 (Why is no real title available?)
- scientific article; zbMATH DE number 3646329 (Why is no real title available?)
- scientific article; zbMATH DE number 3141674 (Why is no real title available?)
- scientific article; zbMATH DE number 3852447 (Why is no real title available?)
- scientific article; zbMATH DE number 3860441 (Why is no real title available?)
- scientific article; zbMATH DE number 3860442 (Why is no real title available?)
- scientific article; zbMATH DE number 3874670 (Why is no real title available?)
- scientific article; zbMATH DE number 3904003 (Why is no real title available?)
- scientific article; zbMATH DE number 3750248 (Why is no real title available?)
- scientific article; zbMATH DE number 3640922 (Why is no real title available?)
- scientific article; zbMATH DE number 2021555 (Why is no real title available?)
- Multidimensional binary search trees used for associative searching
- On the foundations of the universal relation model
- Ordering conjunctive queries
- Quad trees: A data structure for retrieval by composite keys
- Synthesis of unnormalized relations incorporating more meaning
- The relational model with relation-valued attributes
- Tiling with polyominoes
This page was built for publication: Data analysis using a geometrical representation of predicate calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q578939)