Sciweavers

ICDT
2001
ACM
104views Database» more  ICDT 2001»
14 years 5 days ago
Flexible Data Cubes for Online Aggregation
Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi
ICDT
2001
ACM
124views Database» more  ICDT 2001»
14 years 5 days ago
Why and Where: A Characterization of Data Provenance
Withthe proliferation of database views and curated databases, the issue of data provenance where a piece of data came from and the process by which it arrived in the database is b...
Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
ICDT
2001
ACM
153views Database» more  ICDT 2001»
14 years 5 days ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
ICDT
2001
ACM
131views Database» more  ICDT 2001»
14 years 5 days ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
ICDT
2001
ACM
189views Database» more  ICDT 2001»
14 years 5 days ago
A Semi-monad for Semi-structured Data
This document proposes an algebra for XML Query. The algebra has been submitted to the W3C XML Query Working Group. A novel feature of the algebra is the use of regular-expression ...
Mary F. Fernández, Jérôme Sim&...
ICDT
2001
ACM
116views Database» more  ICDT 2001»
14 years 5 days ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
ICDT
2001
ACM
124views Database» more  ICDT 2001»
14 years 5 days ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
ICDT
2001
ACM
110views Database» more  ICDT 2001»
14 years 5 days ago
On Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
Chen Li, Edward Y. Chang
ICDT
2001
ACM
147views Database» more  ICDT 2001»
14 years 5 days ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
ICDT
2001
ACM
162views Database» more  ICDT 2001»
14 years 5 days ago
Algebraic Rewritings for Optimizing Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing etc. Query rewriting in relational databases ...
Gösta Grahne, Alex Thomo