Sciweavers

2889 search results - page 52 / 578
» Querying Structured Hyperdocuments
Sort
View
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
13 years 8 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
VLDB
2002
ACM
126views Database» more  VLDB 2002»
15 years 5 months ago
Plan Selection Based on Query Clustering
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
Antara Ghosh, Jignashu Parikh, Vibhuti S. Sengar, ...
CORR
2012
Springer
209views Education» more  CORR 2012»
14 years 1 months ago
Aggregation in Probabilistic Databases via Knowledge Compilation
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
Robert Fink, Larisa Han, Dan Olteanu
ICMCS
2006
IEEE
91views Multimedia» more  ICMCS 2006»
16 years 1 days ago
Detecting Changes in User-Centered Music Query Streams
In this paper, we propose an efficient algorithm, called MQSchange (changes of Music Query Streams), to detect the changes of maximal melody structures in user-centered music quer...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
PVLDB
2011
15 years 29 days ago
Hyper-local, directions-based ranking of places
Studies find that at least 20% of web queries have local intent; and the fraction of queries with local intent that originate from mobile properties may be twice as high. The eme...
Petros Venetis, Hector Gonzalez, Christian S. Jens...