7593 search results - page 153 / 1519 » Querying XML Databases |
253
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
179
Voted
DATESO
2007
15 years 7 months ago
2007
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
178
click to vote
XIMEP
2004
ACM
15 years 11 months ago
2004
ACM
Most current XQuery implementations require that all XML data reside in memory in one form or another before they start processing the data. This is unacceptable for large XML doc...
154
click to vote
SIS
2007
15 years 7 months ago
2007
Access control models for XML data can be classified in two major categories: node filtering and query rewriting systems. The first category includes approaches that use access ...
180
click to vote
CIKM
2004
Springer
15 years 11 months ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...