353 search results - page 11 / 71 » Processing Top-k Join Queries |
DATESO
2008
13 years 9 months ago
2008
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
Recent data stream systems such as TelegraphCQ have employed the well-known property of duality between data and queries. In these systems, query processing methods are classified...
ICDM
2002
IEEE
14 years 27 days ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
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...
CIKM
1994
Springer
14 years 1 days ago
1994
Springer
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...