353 search results - page 13 / 71 » Processing Top-k Join Queries |
ICDE
2003
IEEE
14 years 9 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...
CIKM
2009
Springer
13 years 12 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...
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
There has been much recent interest in XML publish/subscribe systems. Some systems scale to thousands of concurrent queries, but
ICDE
2008
IEEE
14 years 9 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...
TOOLS
1999
IEEE
14 years 6 days 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...