Sciweavers

1160 search results - page 108 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
WWW
2007
ACM
16 years 2 months ago
Answering bounded continuous search queries in the world wide web
Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries. The improvement of continuous sea...
Dirk Kukulenz, Alexandros Ntoulas
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
15 years 7 months ago
Derby/S: a DBMS for sample-based query answering
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
Anja Klein, Rainer Gemulla, Philipp Rösch, Wo...
ICDE
2005
IEEE
123views Database» more  ICDE 2005»
15 years 7 months ago
Load and Network Aware Query Routing for Information Integration
Current federated systems deploy cost-based query optimization mechanisms; i.e., the optimizer selects a global query plan with the lowest cost to execute. Thus, cost functions in...
Wen-Syan Li, Vishal S. Batra, Vijayshankar Raman, ...
CIKM
2009
Springer
15 years 6 months ago
Minimal common container of tree patterns
Tree patterns represent important fragments of XPath. In this paper, we show that some classes of tree patterns exhibit such a property that, given a finite number of tree patter...
Junhu Wang, Jeffrey Xu Yu, Chaoyi Pang, Chengfei L...
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 1 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller