Sciweavers

1160 search results - page 5 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
14 years 11 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 4 months ago
Tree-Pattern Queries on a Lightweight XML Processor
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
Mirella Moura Moro, Zografoula Vagena, Vassilis J....
VLDB
2001
ACM
94views Database» more  VLDB 2001»
14 years 3 months ago
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
Ilaria Bartolini, Paolo Ciaccia, Florian Waas
VLDB
2002
ACM
133views Database» more  VLDB 2002»
14 years 11 months ago
Tree pattern query minimization
: Purpose ? Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are prese...
Sihem Amer-Yahia, SungRan Cho, Laks V. S. Lakshman...
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 4 months ago
Analyzing Plan Diagrams of Database Query Optimizers
A “plan diagram” is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. In this paper, we present and an...
Naveen Reddy, Jayant R. Haritsa