Sciweavers

654 search results - page 53 / 131
» Complexity of Answering Queries Using Materialized Views
Sort
View
92
Voted
OTM
2005
Springer
15 years 8 months ago
Optimization of Distributed Queries in Grid Via Caching
Abstract. Caching can highly improve performance of query processing in distributed databases. In this paper we show how this technique can be used in grid architecture where data ...
Piotr Cybula, Hanna Kozankiewicz, Krzysztof Stence...
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 8 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
IDEAS
1999
IEEE
123views Database» more  IDEAS 1999»
15 years 7 months ago
Improving OLAP Performance by Multidimensional Hierarchical Clustering
Data-warehousing applications cope with enormous data sets in the range of Gigabytes and Terabytes. Queries usually either select a very small set of this data or perform aggregat...
Volker Markl, Frank Ramsak, Rudolf Bayer
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
16 years 4 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
16 years 3 months ago
Constraint-Based XML Query Rewriting For Data Integration
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
Cong Yu, Lucian Popa