1160 search results - page 53 / 232 » Query Processing and Optimization for Pictorial Query Trees |
DBISP2P
2005
Springer
15 years 3 months ago
2005
Springer
In this work we address the issue of efficient processing of range queries in DHT-based P2P data networks. The novelty of the proposed approach lies on architectures, algorithms, ...
SIGMOD
2003
ACM
15 years 10 months ago
2003
ACM
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
WWW
2006
ACM
15 years 10 months ago
2006
ACM
An XML range query may impose predicates on the numerical or textual contents of the elements and/or their respective path structures. In order to handle content and structure ran...
KDID
2003
14 years 11 months ago
2003
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
102
click to vote
FOIKS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...