Sciweavers

250 search results - page 3 / 50
» Tree pattern query minimization
Sort
View
BNCOD
2009
145views Database» more  BNCOD 2009»
13 years 8 months ago
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Pared...
GD
2009
Springer
13 years 11 months ago
On the Characterization of Level Planar Trees by Minimal Patterns
We consider characterizations of level planar trees. Healy et al. [8] characterized the set of trees that are level planar in terms of two minimal level non-planar (MLNP) patterns....
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
EDBT
2000
ACM
13 years 10 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
SEMWEB
2005
Springer
14 years 14 days ago
Containment and Minimization of RDF/S Query Patterns
Semantic query optimization (SQO) has been proved to be quite useful in various applications (e.g., data integration, graphical query generators, caching, etc.) and has been extens...
Giorgos Serfiotis, Ioanna Koffina, Vassilis Christ...
DASFAA
2009
IEEE
101views Database» more  DASFAA 2009»
14 years 1 months ago
Eager Evaluation of Partial Tree-Pattern Queries on XML Streams
Current streaming applications have stringent requirements on query response time and memory consumption because of the large (possibly unbounded) size of data they handle. Further...
Dimitri Theodoratos, Xiaoying Wu