✦ LIBER ✦

A data structure for dynamic range queries

✍ Scribed by George S. Lueker; Dan E. Willard

Book ID: 113162492
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 645 KB
Volume: 15
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(82)90119-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Opportunistic data structures for range

Opportunistic data structures for range queries

✍ Chung Keung Poon; Wai Keung Yiu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 315 KB

Range queries in dynamic OLAP data cubes

✍ Weifa Liang; Hui Wang; Maria E. Orlowska 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 776 KB

A range query applies an aggregation operation (e.g., SUM) over all selected cells of an OLAP data cube where the selection is speci®ed by providing ranges of values for numeric dimensions. Range sum queries on data cubes are a powerful analysis tool. Many application domains require that data cubes

A dynamic data structure for top-k queri

A dynamic data structure for top-k queries on uncertain data

✍ Jiang Chen; Ke Yi 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 663 KB

Data Structures for Extension Violations

Data Structures for Extension Violations in a Query Range

✍ Ananda Swarup Das; Prosenjit Gupta; Kannan Srinathan 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 497 KB

A log log n data structure for three-sid

A log log n data structure for three-sided range queries

✍ O. Fries; K. Mehlhorn; S. Näher; A. Tsakalidis 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 349 KB

Efficient external memory structures for

Efficient external memory structures for range-aggregate queries

✍ Pankaj K. Agarwal; Lars Arge; Sathish Govindarajan; Jun Yang; Ke Yi 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 396 KB