Computational geometry: an introduction
Computational geometry: an introduction
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Efficient structures for geometric data management
Efficient structures for geometric data management
Indexing for data models with constraints and classes (extended abstract)
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient Indexing for Constraint and Temporal Databases
ICDT '97 Proceedings of the 6th International Conference on Database Theory
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Manipulating Spatial Data in Constraint Databases
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
External-memory computational geometry
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
| Hi-index | 0.00 |
Constraint databases have recently been proposed as a powerfulframework to model and retrieve spatial data. The use of constraint databases should be supported by access data structures that make effective use of secondary storage and reduce query processing time. In this paper; we consider the indexing problem for objects represented by conjunctions of two-variable linear constraints and we analyze the problem of determining all generalized tuples whose extension intersects or is contained in the extension of a given half-plane. In [4], we have shown that both selection problems can be reduced to a point location problem by using a dual transformation 14, IO]. If the angular coefJicient of the half-plane belongs to a predejned set, we have proved that a dynamic optimal indexing solution, based on Bf -trees, exists. In this paper we propose two approximation techniques that can be used to3nd the result when the angular coefficient does not belong to the predefined set. We also experimentally compare the proposed techniques with R-trees.