Sciweavers

907 search results - page 76 / 182
» Efficient Optimization of Iterative Queries
Sort
View
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 9 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 9 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
CIDR
2009
152views Algorithms» more  CIDR 2009»
13 years 10 months ago
Visualizing the robustness of query execution
In database query processing, actual run-time conditions (e.g., actual selectivities and actual available memory) very often differ from compile-time expectations of run-time cond...
Goetz Graefe, Harumi A. Kuno, Janet L. Wiener
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 4 months ago
Top-K Color Queries for Document Retrieval
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
Marek Karpinski, Yakov Nekrich
DEBU
2008
125views more  DEBU 2008»
13 years 9 months ago
Querying XML in Timber
In this paper, we describe the TIMBER XML database system implemented at University of Michigan. TIMBER was one of the first native XML database systems, designed from the ground ...
Yuqing Wu, Stelios Paparizos, H. V. Jagadish