Sciweavers

2217 search results - page 69 / 444
» Rank-aware Query Optimization
Sort
View
FOCS
2006
IEEE
15 years 8 months ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk
BTW
2003
Springer
128views Database» more  BTW 2003»
15 years 7 months ago
Quality of Service and Optimization in Data Integration Systems
: Due to the ever increasing impacts of globalization, people will/have to work on data which is distributed all around the world [LKK+ 97]. Query processing on the corresponding d...
Reinhard Braumandl
133
Voted
SSDBM
2008
IEEE
149views Database» more  SSDBM 2008»
15 years 8 months ago
Query Planning for Searching Inter-dependent Deep-Web Databases
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
Fan Wang, Gagan Agrawal, Ruoming Jin
106
Voted
FGCS
2000
81views more  FGCS 2000»
15 years 2 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
ICDE
2010
IEEE
194views Database» more  ICDE 2010»
15 years 9 months ago
Visualizing cost-based XQuery optimization
Abstract— Developing a full-fledged cost-based XQuery optimizer is a fairly complex task. Nowadays, there is little knowledge concerning suitable cost formulae and optimization ...
Andreas M. Weiner, Theo Härder, Renato Olivei...