ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS), Volume 29 Issue 1, March 2004

Foreword
Phokion Kolaitis, Michael J. Franklin
Pages: 1-1
DOI: 10.1145/974750.974751

Archiving scientific data
Peter Buneman, Sanjeev Khanna, Keishi Tajima, Wang-Chiew Tan
Pages: 2-42
DOI: 10.1145/974750.974752
Archiving is important for scientific data, where it is necessary to record all past versions of a database in order to verify findings based upon a specific version. Much scientific data is held in a hierachical format and has a key structure that...

Probabilistic wavelet synopses
Minos Garofalakis, Phillip B. Gibbons
Pages: 43-90
DOI: 10.1145/974750.974753
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopses") that can be used to provide fast and reasonably accurate approximate...

Accelerating XPath evaluation in any RDBMS
Torsten Grust, Maurice Van Keulen, Jens Teubner
Pages: 91-131
DOI: 10.1145/974750.974754
This article is a proposal for a database index structure, the XPath accelerator, that has been specifically designed to support the evaluation of XPath path expressions. As such, the index is capable to support all XPath axes...

Selection conditions in main memory
Kenneth A. Ross
Pages: 132-161
DOI: 10.1145/974750.974755
We consider the fundamental operation of applying a compound filtering condition to a set of records. With large main memories available cheaply, systems may choose to keep the data entirely in main memory, in order to improve query and/or update...

Characterizing memory requirements for queries over continuous data streams
Arvind Arasu, Brian Babcock, Shivnath Babu, Jon McAlister, Jennifer Widom
Pages: 162-194
DOI: 10.1145/974750.974756
This article deals with continuous conjunctive queries with arithmetic comparisons and optional aggregation over multiple data streams. An algorithm is presented for determining whether or not any given query can be evaluated using a bounded amount...

A normal form for XML documents
Marcelo Arenas, Leonid Libkin
Pages: 195-232
DOI: 10.1145/974750.974757
This article takes a first step towards the design and normalization theory for XML documents. We show that, like relational databases, XML documents may contain redundant information, and may be prone to update anomalies. Furthermore, such problems...