Indexing for data models with constraints and classes
From MaRDI portal
Publication:1924391
DOI10.1006/jcss.1996.0043zbMath0858.68023OpenAlexW1994101999MaRDI QIDQ1924391
Sridhar Ramaswamy, Jeffrey Scott Vitter, Paris C. Kanellakis, Darren Erik Vengroff
Publication date: 26 November 1996
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1996.0043
Related Items
The buffer tree: A new technique for optimal I/O-algorithms ⋮ Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep ⋮ Topology B-trees and their applications ⋮ Finitely representable databases ⋮ Indexing moving points ⋮ Dynamic 3-sided planar range queries with expected doubly-logarithmic time ⋮ Constraint-generating dependencies ⋮ Efficient searching with linear constraints
