Sciweavers

706 search results - page 6 / 142
» XPath Queries on Streaming Data
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 9 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
ADC
2008
Springer
141views Database» more  ADC 2008»
14 years 4 months ago
Approximate Retrieval of XML Data with ApproXPath
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
Lin Xu, Curtis E. Dyreson
SDMW
2009
Springer
14 years 4 months ago
Controlling Access to XML Documents over XML Native and Relational Databases
In this paper we investigate the feasibility and efficiency of mapping XML data and access control policies onto relational and native XML databases for storage and querying. We de...
Lazaros Koromilas, George Chinis, Irini Fundulaki,...
XIMEP
2004
ACM
108views Database» more  XIMEP 2004»
14 years 3 months ago
The Joy of SAX
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...
Leonidas Fegaras
JACM
2008
91views more  JACM 2008»
13 years 9 months ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari