Sciweavers

2063 search results - page 221 / 413
» Containment of Aggregate Queries
Sort
View
ICDE
1997
IEEE
101views Database» more  ICDE 1997»
16 years 7 months ago
Selectivity Estimation in the Presence of Alphanumeric Correlations
Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we ...
Min Wang, Jeffrey Scott Vitter, Balakrishna R. Iye...
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
16 years 6 months ago
Scalable join processing on very large RDF graphs
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
Thomas Neumann, Gerhard Weikum
SIGMOD
2007
ACM
170views Database» more  SIGMOD 2007»
16 years 5 months ago
Cardinality estimation using sample views with quality assurance
Accurate cardinality estimation is critically important to high-quality query optimization. It is well known that conventional cardinality estimation based on histograms or simila...
Per-Åke Larson, Wolfgang Lehner, Jingren Zho...
SIGMOD
2003
ACM
240views Database» more  SIGMOD 2003»
16 years 5 months ago
XRANK: Ranked Keyword Search over XML Documents
We consider the problem of efficiently producing ranked results for keyword search queries over hyperlinked XML documents. Evaluating keyword search queries over hierarchical XML ...
Lin Guo, Feng Shao, Chavdar Botev, Jayavel Shanmug...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
16 years 22 days ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara