Sciweavers

1782 search results - page 48 / 357
» Processing Queries over Distributed XML Databases
Sort
View
ADBIS
2007
Springer
119views Database» more  ADBIS 2007»
14 years 4 months ago
Combining Efficient XML Compression with Query Processing
This paper describes a new XML compression scheme that offers both high compression ratios and short query response time. Its core is a fully reversible transform featuring substit...
Przemyslaw Skibinski, Jakub Swacha
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
14 years 10 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
WWW
2004
ACM
14 years 10 months ago
A query algebra for xml p2p databases
This paper describes a query algebra for queries over XML p2p databases that provides explicit mechanisms for modeling data dissemination, replication constraints, and for capturi...
Carlo Sartiani
CIMCA
2008
IEEE
13 years 12 months ago
RIAL: Redundancy Reducing Inlining Algorithm to Map XML DTD to Relations
XML has emerged as a common standard for data exchange over the World Wide Web. One way to manage XML data is to use the power of relational databases for storing and q...
Amir Jahangard Rafsanjani, Seyed-Hassan Mirian-Hos...
PVLDB
2010
146views more  PVLDB 2010»
13 years 4 months ago
Generating Efficient Execution Plans for Vertically Partitioned XML Databases
Experience with relational systems has shown that distribution is an effective way of improving the scalability of query evaluation. In this paper, we show how distributed query e...
Patrick Kling, M. Tamer Özsu, Khuzaima Daudje...