Sciweavers

43 search results - page 3 / 9
» Inverse Roles Make Conjunctive Queries Hard
Sort
View
PODS
2006
ACM
196views Database» more  PODS 2006»
14 years 11 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
OTM
2007
Springer
14 years 5 months ago
Scalability of OWL Reasoning: Role condensates
In the last years, there has been an increasing interest in the performance of reasoning on the Semantic Web in presence of large ABoxes. Traditional reasoners make heavily use of ...
Sebastian Wandelt, Ralf Möller
PODS
2012
ACM
297views Database» more  PODS 2012»
12 years 1 months ago
Query-based data pricing
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
Paraschos Koutris, Prasang Upadhyaya, Magdalena Ba...
SIGIR
2011
ACM
13 years 1 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 10 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...