Sciweavers

479 search results - page 21 / 96
» Efficient Processing of XML Tree Pattern Queries
Sort
View
WWW
2008
ACM
14 years 9 months ago
Efficient vectorial operators for processing xml twig queries
This paper proposes several vectorial operators for processing XML twig queries, which are easy to be performed and inherently efficient for both Ancestor-Descendant (A-D) and Par...
Guoliang Li, Jianhua Feng, Jianyong Wang, Feng Lin...
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 9 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
12 years 12 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
ER
2003
Springer
148views Database» more  ER 2003»
14 years 2 months ago
Improving Query Performance Using Materialized XML Views: A Learning-Based Approach
We consider the problem of improving the efficiency of query processing on an XML interface of a relational database, for predefined query workloads. The main contribution of this ...
Ashish Shah, Rada Chirkova
SIGMOD
2004
ACM
124views Database» more  SIGMOD 2004»
14 years 9 months ago
BLAS: An Efficient XPath Processing System
We present BLAS , a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data. BLAS uses Plabeling to process queries involving consecutive child ax...
Yi Chen, Susan B. Davidson, Yifeng Zheng