Sciweavers

6004 search results - page 269 / 1201
» Parallelizing query optimization
Sort
View
ECOOP
1999
Springer
15 years 4 months ago
Dynamic Query-Based Debugging
Program errors are hard to find because of the cause-effect gap between the time when an error occurs and the time when the error becomes apparent to the programmer. Although debu...
Raimondas Lencevicius, Urs Hölzle, Ambuj K. S...
CIDR
2009
152views Algorithms» more  CIDR 2009»
15 years 1 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
DKE
2006
110views more  DKE 2006»
15 years 19 days ago
Efficient recursive XML query processing using relational database systems
Recursive queries are quite important in the context of XML databases. In addition, several recent papers have investigated a relational approach to store XML data and there is gr...
Sandeep Prakash, Sourav S. Bhowmick, Sanjay Kumar ...
ADBIS
2009
Springer
135views Database» more  ADBIS 2009»
14 years 10 months ago
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
We consider the problem of selecting views and indexes that minimize the evaluation costs of the important queries under an upper bound on the disk space available for storing the ...
Maxim Kormilitsin, Rada Chirkova, Yahya Fathi, Mat...
PDP
2008
IEEE
15 years 7 months ago
Distributed Sparse Spatial Selection Indexes
Searching for similar objects in metric-space databases can be efficiently solved by using index data structures. A number of alternative sequential indexes have been proposed in...
Veronica Gil Costa, Mauricio Marín