Abstract
The filtering method considered in this paper is based on approximation of a spatial object in d-dimensional space by the minimal convex polyhedron that encloses the object and whose facets are normal to preselected axes. These axes are not necessarily the standard coordinate axes; furthermore, their number is not determined by the dimension of the space. We optimize filtering by selecting optimal such axes based on a preprocessing analysis of stored objects or a sample thereof. The number of axes selected represents a trade-off between access time and storage overhead, as more axes usually lead to better filtering but require more overhead to store the associated access structures. We address the problem of minimizing the number of axes required to achieve a predefined quality of filtering and the reverse problem of optimizing the quality of filtering when the number of axes is fixed. In both cases we also show how to find an optimal collection of axes. To solve these problems, we introduce and study the key notion of separability classification, which is a general tool potentially useful in many applications of a computational geometry flavor. The approach is best suited to applications in which the spatial data is relatively static, some directions are more dominant than others, and the dimension of the space is not high; maps are a prime example.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Beckmann, N., Kriegel, H. P., Schneider, R. and Seeder, B.: The R*-tree: An efficient and robust access method for points and rectangles, in Proc. ACM SIGMOD Internat. Conf. on Management of Data, Atlantic City, May 1990, pp. 322–331.
Benjamin, M., Viana, T., Corbett, K. and Silva, A.: Satisfying multiple rated-constraints in a knowledge based decision aid, in Proc. IEEE Conf. on Artificial Intelligence Applications, Orlando, 1993.
Bentley, J. L.: Multidimensional binary search trees used for associative searching, Comm. ACM 18(9), 1975.
Brodsky, A., Jaffar, J. and Maher, M. J.: Toward practical constraint databases, in Proc. 19th International Conference on Very Large Data Bases, 1993, pp. 567–580.
Brodsky, A., Lassez, C. and Lassez, J.-L.: Separability of polyhedra and a new approach to spatial storage, in Proc. Principles and Practice of Constraint Programming, 1993, pp. 6–13.
Brodsky, A., Lassez, C., Lassez, J.-L. and Maher, M. J.: Separability of polyhedra for optimal filtering of spatial and constraint data, in Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 1995.
Edelsbrunner, H.: A new approach to rectangle intersections, Part II, Internat. J. Comput. Math. 13 (1983), 221–229.
Franklin, W. R.: Adaptive grids for geometric operations, Cartographica 21–23 (1984), 160–167.
Gunther, O.: Efficient Structures for Geometric Data Management, Lecture Notes in Comput. Sci. 337, Springer-Verlag, Berlin, 1988.
Guttman, A.: R-trees: A dynamic index structure for spatial searching, in Proc. ACMSIGMOD Internat. Conf. on Management of Data, Boston, 1984, pp. 47–57.
Huynh, T., Lassez, C. and Lassez, J.-L.: Practical issues on the projection of polyhedral sets, Ann. Math. Artificial Intelligence (1993).
Jagadish, H. V.: Spatial search with polyhedra, in Proc. IEEE International Conference on Data Engineering, 1990, pp. 311–319.
Kanellakis, P. C., Ramaswamy, S., Vendroff, D. E. and Vitter, J. S.: Indexing for data models with constraint and classes, in Proc. ACM Conf. on Principles of Database Systems, 1993, pp. 233–243.
Lassez, J.-L.: Querying constraints, in Proc. ACM Conf. on Principles of Database Systems, Nashville, TN, 1990, pp. 289–299.
McCreight, E. M.: Priority search trees, SIAM J. Comput. 14(2) (1985), 257–276.
Nelson, R. C. and Samet, H.: A population analysis for hierarchical data structures, in Proc. of the SIGMOD Conf. San Francisco, May 1987, pp. 270–277.
Nievergelt, J.: 7 ± 2 criteria for assessing and comparing spatial databases, in Symp. on the Design and Implementation of Large Spatial Databases, Springer-Verlag, New York, pp. 89–114.
Orenstein, J. A.: Redundancy in spatial databases, in Proc. of the SIGMOD Conf., Portland, OR, June 1989, pp. 294–305.
Robinson, J. T.: K-D-B-tree: A search structure for large multidimensional dynamic indices, in Proc. ACM SIGMOD Conference on Management of Data, 1981.
Roussopoulos, N. and Leifker, D.: An introduction to PSQL: A pictorial structured query language, in IEEE Workshop on Visual Language, Hiroshima, Japan, 1984, pp. 77–84.
Roussopoulos, N. and Leifker, D.: Direct spatial search on pictorial databases using packed R-trees, in Proc. ACM SIGMOD, 1985, pp. 17–31.
Samet, H. and Webber, R. E.: Storing a collection of polygons using quadtrees, ACM Trans. on Graphics 4(3) (July 1985), 182–222.
Sellis, T., Roussopoulos, N. and Faloutsus, C.: The RC-tree: A dynamic index for multidimensional objects, in Proc. 13th Internat. Conf. Very Large Data Bases, 1987, pp. 507–518.
Six, H. W. and Wood, D.: Counting and reporting intersections of d-ranges, IEEE Trans. Comput. C-31 (1982), 181–187.
Tamminen, M.: Efficient Spatial Access to a Data Base, Acta Polytech. Scand. Math. Comput. Sci. Ser. 34, Helsinki, Finland, 1981.
Thibault, W. C. and Naylor, B. F.: Set operations on polyhedra using binary space partitioning trees, Comput. Graph. 21(4) (July 1987), 153–162.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Brodsky, A., Lassez, C., Lassez, JL. et al. Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data. Journal of Automated Reasoning 23, 83–104 (1999). https://doi.org/10.1023/A:1006171919920
Issue Date:
DOI: https://doi.org/10.1023/A:1006171919920