513 search results - page 32 / 103 » Cache Conscious Algorithms for Relational Query Processing |
72
Voted
ICDT
1995
ACM
15 years 1 months ago
1995
ACM
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
82
Voted
WWW
2006
ACM
15 years 10 months ago
2006
ACM
We introduce the notion of query substitution, that is, generating a new query to replace a user's original search query. Our technique uses modifications based on typical su...
103
Voted
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
134
click to vote
WEBDB
2010
Springer
15 years 1 months ago
2010
Springer
Data on the Web is increasingly being used for discovery and exploratory tasks. Unlike traditional fact-finding tasks that require only the typical single-query and response parad...
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...