Sciweavers

303 search results - page 11 / 61
» Using a compact tree to index and query XML data
Sort
View
SISAP
2009
IEEE
159views Data Mining» more  SISAP 2009»
14 years 2 months ago
Dynamic P2P Indexing and Search Based on Compact Clustering
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Mauricio Marín, Veronica Gil Costa, Cecilia...
DAWAK
2000
Springer
13 years 11 months ago
Optimal Multidimensional Query Processing Using Tree Striping
In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalize...
Stefan Berchtold, Christian Böhm, Daniel A. K...
VLDB
2006
ACM
115views Database» more  VLDB 2006»
14 years 7 months ago
Integrating document and data retrieval based on XML
For querying structured and semistructured data, data retrieval and document retrieval are two valuable and complementary techniques that have not yet been fully integrated. In thi...
Jan-Marco Bremer, Michael Gertz
WEBDB
2001
Springer
113views Database» more  WEBDB 2001»
13 years 12 months ago
Indexing XML Data with ToXin
Indexing schemes for semistructured data have been developed in recent years to optimize path query processing by summarizing path information. However, most of these schemes can ...
Flavio Rizzolo, Alberto O. Mendelzon
DEXA
2004
Springer
96views Database» more  DEXA 2004»
14 years 26 days ago
A Selective Key-Oriented XML Index for the Index Selection Problem in XDBMS
Abstract. In relational database management systems indexes are used to accelerate specific queries. The selection of indexes is an important task when tuning a database which is ...
Beda Christoph Hammerschmidt, Martin Kempa, Volker...