Sciweavers

3225 search results - page 230 / 645
» Query Optimization by Stored Queries
Sort
View
PVLDB
2008
122views more  PVLDB 2008»
15 years 4 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
SIGMOD
2003
ACM
140views Database» more  SIGMOD 2003»
16 years 5 months ago
Stream Processing of XPath Queries with Predicates
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
Ashish Kumar Gupta, Dan Suciu
147
Voted
UAI
2003
15 years 6 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
15 years 11 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
120
Voted
BIRTHDAY
2010
Springer
15 years 5 months ago
Distributed SQL Queries with BubbleStorm
Abstract. Current peer-to-peer (p2p) systems place the burden of application-level query execution on the application developer. Not only do application developers lack the experti...
Christof Leng, Wesley W. Terpstra