scientific article; zbMATH DE number 910894

zbMATH Open0848.68029MaRDI QIDQ4886069FDOQ4886069

Authors: Sridhar Ramaswamy, Sairam Subramanian 

Publication date: 22 August 1996

Title of this publication is not available (Why is that?)

Recommendations

• Maintaining range trees in secondary memory. Part I: Partitions
• scientific article; zbMATH DE number 1256735
• Maintaining range trees is secondary memory. Part II: Lower bounds
• scientific article; zbMATH DE number 4051018
• Approximate Range Searching in External Memory

zbMATH Keywords

data structuretemporal databasesconstraint databasesexternal 2-dimensional range searching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10)

Cited In (18)

• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
• Dynamic 3-sided planar range queries with expected doubly-logarithmic time
• Title not available (Why is that?)
• Optimal external memory planar point enclosure
• Finding Pairwise Intersections Inside a Query Range
• Efficient range searching for categorical and plain data
• Efficient searching with linear constraints
• Title not available (Why is that?)
• Maintaining range trees is secondary memory. Part II: Lower bounds
• Data replication in static tree structures
• Title not available (Why is that?)
• Maintaining range trees in secondary memory. Part I: Partitions
• New Data Structures for Orthogonal Range Queries
• Space Efficient Multi-dimensional Range Reporting
• The buffer tree: A new technique for optimal I/O-algorithms
• On Dominance Reporting in 3D
• Geometric BWT: compressed text indexing via sparse suffixes and range searching
• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep

This page was built for publication:

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