Sciweavers

508 search results - page 28 / 102
» Bringing Order to Query Optimization
Sort
View
APPROX
2005
Springer
90views Algorithms» more  APPROX 2005»
14 years 1 months ago
Tight Bounds for String Reconstruction Using Substring Queries
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
Dekel Tsur
PPDP
2010
Springer
13 years 6 months ago
Deriving predicate statistics in datalog
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...
Senlin Liang, Michael Kifer
EDBT
2000
ACM
14 years 23 hour ago
Spatial Distributions Server Based on Linear Quadtree
The paper presents Spatial Distributions Server – an analytical tool aimed at efficient creation, storing and analyzing of spatial distributions. Methods of approximation of spat...
Piotr Bajerski
JUCS
2002
120views more  JUCS 2002»
13 years 7 months ago
Instance Cooperative Memory to Improve Query Expansion in Information Retrieval Systems
The main goal of this research is to improve Information Retrieval Systems by enabling them to generate search outcomes that are relevant and customized to each specific user. Our ...
Lobna Jeribi, Béatrice Rumpler
FUIN
2006
139views more  FUIN 2006»
13 years 7 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale