Efficient searching with linear constraints
- 1 May 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 169-178
- https://doi.org/10.1145/275487.275506
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- The hB $^Pi$ -tree: a multi-attribute index supporting concurrency, recovery and node consolidationThe VLDB Journal, 1997
- Indexing for Data Models with Constraints and ClassesJournal of Computer and System Sciences, 1996
- Geometric range searchingACM Computing Surveys, 1994
- Intersection Queries in Curved ObjectsJournal of Algorithms, 1993
- Reporting points in halfspacesComputational Geometry, 1992
- The hB-tree: a multiattribute indexing method with good guaranteed performanceACM Transactions on Database Systems, 1990
- New upper bounds for neighbor searchingInformation and Control, 1986
- The power of geometric dualityBIT Numerical Mathematics, 1985
- The Grid FileACM Transactions on Database Systems, 1984
- Ubiquitous B-TreeACM Computing Surveys, 1979