Sciweavers

3303 search results - page 490 / 661
» Multidimensional Access Methods
Sort
View
VLDB
2001
ACM
157views Database» more  VLDB 2001»
16 years 6 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
VLDB
2002
ACM
139views Database» more  VLDB 2002»
16 years 6 months ago
TIMBER: A native XML database
Abstract This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based u...
H. V. Jagadish, Shurug Al-Khalifa, Adriane Chapman...
VLDB
2007
ACM
119views Database» more  VLDB 2007»
16 years 6 months ago
Path and cache conscious prefetching (PCCP)
Main memory cache performance continues to play an important role in determining the overall performance of object-oriented, object-relational and XML databases. An effective metho...
Zhen He, Alonso Marquez
VLDB
2008
ACM
131views Database» more  VLDB 2008»
16 years 6 months ago
Primal or dual: which promises faster spatiotemporal search?
The existing predictive spatiotemporal indexes can be classified into two categories, depending on whether they are based on the primal or dual methodology. Although we have gaine...
Yufei Tao, Xiaokui Xiao
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang