External memory algorithms and data structures: Dealing with massive data

JS Vitter - ACM Computing surveys (CsUR), 2001 - dl.acm.org
Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …

[책][B] R-Trees: Theory and Applications: Theory and Applications

Y Manolopoulos, A Nanopoulos, AN Papadopoulos… - 2006 - books.google.com
Space support in databases poses new challenges in every part of a database management
system & the capability of spatial support in the physical layer is considered very important …

[책][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques

MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

The priority R-tree: A practically efficient and worst-case optimal R-tree

L Arge, M Berg, H Haverkort, K Yi - ACM Transactions on Algorithms …, 2008 - dl.acm.org
We present the priority R-tree, or PR-tree, which is the first R-tree variant that always
answers a window query using O ((N/B) 1− 1/d+ T/B) I/Os, where N is the number of d …

[책][B] Handbook of data structures and applications

DP Mehta, S Sahni - 2004 - taylorfrancis.com
Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

Spatial join techniques

EH Jacox, H Samet - ACM Transactions on Database Systems (TODS), 2007 - dl.acm.org
A variety of techniques for performing a spatial join are reviewed. Instead of just
summarizing the literature and presenting each technique in its entirety, distinct components …

isax 2.0: Indexing and mining one billion time series

A Camerra, T Palpanas, J Shieh… - 2010 IEEE international …, 2010 - ieeexplore.ieee.org
There is an increasingly pressing need, by several applications in diverse domains, for
develo** techniques able to index and mine very large collections of time series …

B-tree indexes for high update rates

G Graefe - ACM Sigmod Record, 2006 - dl.acm.org
In some applications, data capture dominates query processing. For example, monitoring
moving objects often requires more insertions and updates than queries. Data gathering …

Algorithms and data structures for external memory

JS Vitter - … and Trends® in Theoretical Computer Science, 2008 - nowpublishers.com
Data sets in large applications are often too massive to fit completely inside the computer's
internal memory. The resulting input/output communication (or I/O) between fast internal …

The buffer tree: A technique for designing batched external data structures

L Arge - Algorithmica, 2003 - Springer
We present a technique for designing external memory data structures that support batched
operations I/O efficiently. We show how the technique can be used to develop external …