Sciweavers

303 search results - page 3 / 61
» Using a compact tree to index and query XML data
Sort
View
RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 3 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei
ADC
2008
Springer
135views Database» more  ADC 2008»
13 years 11 months ago
Faster Path Indexes for Search in XML Data
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
Nils Grimsmo
SOFSEM
2004
Springer
13 years 10 months ago
Tree Signatures and Unordered XML Pattern Matching
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
Pavel Zezula, Federica Mandreoli, Riccardo Martogl...
COMAD
2009
13 years 6 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
ICDE
2005
IEEE
160views Database» more  ICDE 2005»
13 years 11 months ago
NXS: Native XML processing in Sybase RDBMS
Sybase's flagship database product, Adaptive Server Enterprise provides Native XML processing (NXS) support. In this paper we present our experience related to query processi...
Anupam Singh, Srikanth Sampath, Vadiraja Bhatt, Fr...