ACM DL

Database Systems (TODS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003, Volume 30 Issue 1, March 2005

Exchanging intensional XML data
Tova Milo, Serge Abiteboul, Bernd Amann, Omar Benjelloun, Fred Dang Ngoc
Pages: 1-40
DOI: 10.1145/1061318.1061319
XML is becoming the universal format for data exchange between applications. Recently, the emergence of Web services as standard means of publishing and accessing data on the Web introduced a new class of XML documents, which we call...

Progressive skyline computation in database systems
Dimitris Papadias, Yufei Tao, Greg Fu, Bernhard Seeger
Pages: 41-82
DOI: 10.1145/1061318.1061320
The skyline of a d-dimensional dataset contains the points that are not dominated by any other point on all dimensions. Skyline computation has recently received considerable attention in the database community, especially for progressive...

Advanced SQL modeling in RDBMS
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozkaya, Nathan Folkert, Abhinav Gupta, John Haydu, Lei Sheng, Sankar Subramanian
Pages: 83-121
DOI: 10.1145/1061318.1061321
Commercial relational database systems lack support for complex business modeling. ANSI SQL cannot treat relations as multidimensional arrays and define multiple, interrelated formulas over them, operations which are needed for business modeling....

TinyDB: an acquisitional query processing system for sensor networks
Samuel R. Madden, Michael J. Franklin, Joseph M. Hellerstein, Wei Hong
Pages: 122-173
DOI: 10.1145/1061318.1061322
We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing...

Data exchange: getting to the core
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa
Pages: 174-210
DOI: 10.1145/1061318.1061323
Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. Given a source instance, there may be many solutions to the data...

Concise descriptions of subsets of structured sets
Ken Q. Pu, Alberto O. Mendelzon
Pages: 211-248
DOI: 10.1145/1061318.1061324
We study the problem of economical representation of subsets of structured sets, which are sets equipped with a set cover or a family of preorders. Given a structured set U, and a language L whose expressions define subsets of U, the...

What's hot and what's not: tracking most frequent items dynamically
Graham Cormode, S. Muthukrishnan
Pages: 249-278
DOI: 10.1145/1061318.1061325
Most database management systems maintain statistics on the underlying relation. One of the important statistics is that of the “hot items” in the relation: those that appear many times (most frequently, or more than some threshold). For...

XML stream processing using tree-edit distance embeddings
Minos Garofalakis, Amit Kumar
Pages: 279-332
DOI: 10.1145/1061318.1061326
We propose the first known solution to the problem of correlating, in small space, continuous streams of XML data through approximate (structure and content) matching, as defined by a general tree-edit distance metric. The key element of our solution...