353 search results - page 13 / 71 » Processing Top-k Join Queries |
227
click to vote
ICDE
2003
IEEE
16 years 3 months ago
2003
IEEE
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
132
click to vote
CIKM
2009
Springer
15 years 5 months ago
2009
Springer
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
163
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
There has been much recent interest in XML publish/subscribe systems. Some systems scale to thousands of concurrent queries, but
213
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
112
click to vote
TOOLS
1999
IEEE
15 years 6 months ago
1999
IEEE
Path traversals have been recognized as one of the strengths of object-oriented query processing as object retrieval can be carried out through pointer navigation. Apart from path...