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 …

This paper compares different indexing techniques proposed for supporting efficient access
to temporal data. The comparison is based on a collection of important performance criteria …

The predicted shift to non-volatile, byte-addressable memory (eg, Phase Change Memory
and Memristor), the growth of “big data”, and the subsequent emergence of frameworks such …

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 …

Among the various types of spatio-temporal queries, the most common ones involve window
queries in time. In particular, timestamp (or timeslice) queries retrieve all the objects that …

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 …

Managing backup data comprises accessing a snapshot of a data set, Wherein the data set
includes at least one object and the snapshot includes a replica of the data set, and adding …

We propose three indexing schemes for storing a set S of N points in the plane, each moving
along a linear trajectory, so that a query of the following form can be answered quickly …

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 …

Publisher Summary This chapter proposes efficient structural join algorithms in the presence
of tag indices. Queries on XML documents typically combine selections on element contents …