Sciweavers

343 search results - page 58 / 69
» Efficient Query Evaluation over Compressed XML Data
Sort
View
DEXAW
2004
IEEE
206views Database» more  DEXAW 2004»
13 years 11 months ago
Adaptive Query Processing and the Grid: Opportunities and Challenges
Grid technologies have been developed in response to an increase in demand for computing applications designed to yield the benefits from collaboration, data sharing and sophistic...
Anastasios Gounaris, Norman W. Paton, Rizos Sakell...
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...
CIKM
2005
Springer
14 years 1 months ago
Optimizing cursor movement in holistic twig joins
Holistic twig join algorithms represent the state of the art for evaluating path expressions in XML queries. Using inverted indexes on XML elements, holistic twig joins move a set...
Marcus Fontoura, Vanja Josifovski, Eugene J. Sheki...
WWW
2008
ACM
14 years 8 months ago
Application of bitmap index to information retrieval
To solve this problem, we devised the HS-bitmap index, which is hierarchically comprised of compressed data of summary bits. A summary bit in an upper matrix is obtained by logical...
Kengo Fujioka, Yukio Uematsu, Makoto Onizuka
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
14 years 7 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...