Indexing for data models with constraints and classes

DOI10.1006/JCSS.1996.0043zbMATH Open0858.68023OpenAlexW1994101999MaRDI QIDQ1924391

Paris C. Kanellakis, Darren Erik Vengroff, Sridhar Ramaswamy, Jeffrey Scott Vitter

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

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Cited In (8)

• Dynamic 3-sided planar range queries with expected doubly-logarithmic time
• Efficient searching with linear constraints
• Constraint-generating dependencies
• Indexing moving points
• Finitely representable databases
• The buffer tree: A new technique for optimal I/O-algorithms
• Topology B-trees and their applications
• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep

This page was built for publication: Indexing for data models with constraints and classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924391)