Keyword

range queries

Description: Database or information-retrieval operations that return records whose values fall within a specified interval or range.

Primary topic: Data Management and Algorithms (29%)

Wikidata ID: wiki/Q818943

OpenAlex ID: keywords/range-queries

An improved data stream summary: the count-min sketch and its applications

2004 · Graham Cormode, S. Muthukrishnan · Journal of Algorithms · 2,224

M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

1997 · Paolo Ciaccia, Marco Patella, et al. · 1,545

Conjunctive, Subset, and Range Queries on Encrypted Data

2007 · Dan Boneh, Brent Waters · Springer eBooks · 1,448

Handbook of Discrete and Computational Geometry, Second Edition

2004 · Chapman & Hall/CRC eBooks · 1,208

The Grid File

1984 · J. Nievergelt, Hans Hinterberger, et al. · ACM Transactions on Database Systems · 1,144

PDF

The K-D-B-tree

1981 · John T. Robinson · Proceedings - ACM-SIGMOD International Conference on Management of Data · 887

PDF

Multidimensional divide-and-conquer

1980 · Jon Louis Bentley · Communications of the ACM · 672

PDF

External memory algorithms and data structures

2001 · Jeffrey Scott Vitter · ACM Computing Surveys · 646

Data Structures for Range Searching

1979 · Jon Louis Bentley, Jerome H. Friedman · ACM Computing Surveys · 622

PDF

SpatialHadoop: A MapReduce framework for spatial data

2015 · Ahmed Eldawy, Mohamed F. Mokbel · Proceedings - International Conference on Data Engineering · 555

Computational geometry : an introduction through randomized algorithms

1994 · Ketan Mulmuley · 542

Boosting the accuracy of differentially private histograms through consistency

2010 · Michael Hay, Vibhor Rastogi, et al. · Proceedings of the VLDB Endowment · 530

PDF

Influence sets based on reverse nearest neighbor queries

2000 · Flip Korn, S. Muthukrishnan · ACM SIGMOD Record · 523

PDF

Priority Search Trees

1985 · Edward M. McCreight · SIAM Journal on Computing · 493

Medians and beyond

2004 · Nisheeth Shrivastava, Chiranjeeb Buragohain, et al. · International Conference on Embedded Networked Sensor Systems · 486

On packing R-trees

1993 · Ibrahim Kamel, Christos Faloutsos · ACM International Conference on Information and Knowledge Management (CIKM) · 484

PDF

Querying imprecise data in moving object environments

2004 · R. Cheng, D.V. Kalashnikov, et al. · IEEE Transactions on Knowledge and Data Engineering · 434

Fractional cascading: I. A data structuring technique

1986 · Bernard Chazelle, Leonidas J. Guibas · Algorithmica · 429

The adaptive radix tree: ARTful indexing for main-memory databases

2013 · V. Leis, Alfons Kemper, et al. · Proceedings - International Conference on Data Engineering · 424

A Privacy-Preserving Index for Range Queries

2004 · Bijit Hore, Sharad Mehrotra, et al. · Elsevier eBooks · 422

Updating and Querying Databases that Track Mobile Units

1999 · Ouri Wolfson, A. Prasad Sistla, et al. · Distributed and Parallel Databases · 412

A class of data structures for associative searching

1984 · J. A. Orenstein, T. H. Merrett · ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS) · 405

PDF

The pyramid-technique

1998 · Stefan Berchtold, Christian Böhm, et al. · Proceedings - ACM-SIGMOD International Conference on Management of Data · 403

PDF

Spatial query processing in an object-oriented database system

1986 · Jack A. Orenstein · ACM SIGMOD Record · 399

An asymptotically optimal multiversion B-tree

1996 · Bruno Becker, Stephan Gschwind, et al. · The VLDB Journal · 389

Works count: 4,528

Citation count: 75,940