Sciweavers

1429 search results - page 47 / 286
» Efficient processing of XPath queries using indexes
Sort
View
IS
2007
13 years 8 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
SSDBM
2006
IEEE
96views Database» more  SSDBM 2006»
14 years 2 months ago
Efficient Query Processing in Arbitrary Subspaces Using Vector Approximations
Hans-Peter Kriegel, Peer Kröger, Matthias Sch...
WWW
2008
ACM
14 years 9 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
VLDB
2002
ACM
99views Database» more  VLDB 2002»
13 years 8 months ago
An Efficient Method for Performing Record Deletions and Updates Using Index Scans
We present a method for efficiently performing deletions and updates of records when the records to be deleted or updated are chosen by a range scan on an index. The traditional m...
C. Mohan