1160 search results - page 84 / 232 » Query Processing and Optimization for Pictorial Query Trees |
94
Voted
ICDE
2012
IEEE
13 years 20 days ago
2012
IEEE
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
118
Voted
DASFAA
2004
IEEE
15 years 1 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
187
click to vote
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...
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
We study fundamental aspects related to the efficient processing of the SPARQL query language for RDF, proposed by the W3C to encode machine-readable information in the Semantic W...
WIDM
2004
ACM
15 years 3 months ago
2004
ACM
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...