Sciweavers

98 search results - page 7 / 20
» sigmod 2003
Sort
View
SIGMOD
2003
ACM
96views Database» more  SIGMOD 2003»
14 years 7 months ago
Toward network data independence
A number of researchers have become interested in the design of global-scale networked systems and applications. Our thesis here is that the database community's principles a...
Joseph M. Hellerstein
SIGMOD
2003
ACM
98views Database» more  SIGMOD 2003»
14 years 7 months ago
On Relational Support for XML Publishing: Beyond Sorting and Tagging
In this paper, we study whether the need for efficient XML publishing brings any new requirements for relational query engines, or if sorting query results in the relational engin...
Surajit Chaudhuri, Raghav Kaushik, Jeffrey F. Naug...
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
14 years 7 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
SIGMOD
2003
ACM
112views Database» more  SIGMOD 2003»
14 years 7 months ago
A Theory of Redo Recovery
Our goal is to understand redo recovery. We define an installation graph of operations in an execution, an ordering significantly weaker than conflict ordering from concurrency co...
David B. Lomet, Mark R. Tuttle
SIGMOD
2003
ACM
172views Database» more  SIGMOD 2003»
14 years 7 months ago
Dynamic Sample Selection for Approximate Query Processing
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
Brian Babcock, Surajit Chaudhuri, Gautam Das