721 search results - page 10 / 145 » Supporting top-k join queries in relational databases |
57
Voted
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
Given a set Q of keywords, conventional keyword search (KS) returns a set of tuples, each of which (i) is obtained from a single relation, or by joining multiple relations, and (i...
91
Voted
SSDBM
2003
IEEE
15 years 2 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
100
click to vote
LWA
2004
14 years 11 months ago
2004
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
104
click to vote
SIGMOD
2012
ACM
13 years 2 days ago
2012
ACM
There exists a need for high performance, read-only mainmemory database systems for OLAP-style application scenarios. Most of the existing works in this area are centered around t...
182
Voted
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...