Sciweavers

80 search results - page 11 / 16
» Efficient evaluation of generalized path pattern queries on ...
Sort
View
WWW
2005
ACM
14 years 8 months ago
A fast XPATH evaluation technique with the facility of updates
This paper addresses the problem of fast retrieval of data from XML documents by providing a labeling schema that can easily handle simple as well as complex XPATH queries and als...
Ashish Virmani, Suchit Agarwal, Rahul Thathoo, She...
CIKM
2001
Springer
14 years 8 days ago
X007: Applying 007 Benchmark to XML Query Processing Tool
If XML is to play the critical role of the lingua franca for Internet data interchange that many predict, it is necessary to start designing and adopting benchmarks allowing the c...
Stéphane Bressan, Gillian Dobbie, Zoé...
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 8 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
ESOP
2006
Springer
13 years 11 months ago
Pure Pattern Calculus
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
C. Barry Jay, Delia Kesner
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
13 years 11 months ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...