Sciweavers

479 search results - page 37 / 96
» Efficient Processing of XML Tree Pattern Queries
Sort
View
COMAD
2009
13 years 10 months ago
A Simple and Scalable Filter for XML Streams
XML stream querying problem involves evaluating a given, potentially large, set of query expressions on a continuous stream of XML messages. Since the messages arrive continuously...
Abdul Nizar, G. Suresh Babu, P. Sreenivasa Kumar
DATESO
2009
119views Database» more  DATESO 2009»
13 years 7 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
ISMIS
2000
Springer
14 years 22 days ago
Top-Down Query Processing in First Order Deductive Databases under the DWFS
A top-down query processing method for first order deductive databases under the disjunctive well-founded semantics (DWFS) is presented. The method is based upon a characterisation...
C. A. Johnson
CIKM
2009
Springer
14 years 1 months ago
Minimal common container of tree patterns
Tree patterns represent important fragments of XPath. In this paper, we show that some classes of tree patterns exhibit such a property that, given a finite number of tree patter...
Junhu Wang, Jeffrey Xu Yu, Chaoyi Pang, Chengfei L...
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
14 years 9 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...