Sciweavers

287 search results - page 27 / 58
» Optimization Techniques for Queries with Expensive Methods
Sort
View
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
15 years 1 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
FOCM
2002
140views more  FOCM 2002»
15 years 7 days ago
Adaptive Wavelet Methods II - Beyond the Elliptic Case
This paper is concerned with the design and analysis of adaptive wavelet methods for systems of operator equations. Its main accomplishment is to extend the range of applicability...
Albert Cohen, Wolfgang Dahmen, Ronald A. DeVore
92
Voted
ISMIS
1999
Springer
15 years 4 months ago
A Statistical Approach to Rule Selection in Semantic Query Optimisation
Semantic Query Optimisation makes use of the semantic knowledge of a database (rules) to perform query transformation. Rules are normally learned from former queries fired by the u...
Barry G. T. Lowden, Jerome Robinson
ICDE
2009
IEEE
190views Database» more  ICDE 2009»
16 years 2 months ago
Progressive Keyword Search in Relational Databases
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
Guoliang Li, Xiaofang Zhou, Jianhua Feng, Jianyong...
200
Voted
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
16 years 18 days ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...