Sciweavers

15 search results - page 1 / 3
» Serving Datacube Tuples from Main Memory
Sort
View
SSDBM
2000
IEEE
86views Database» more  SSDBM 2000»
13 years 12 months ago
Serving Datacube Tuples from Main Memory
Existing datacube precompuatation schemes materialize selected datacube tuples on disk, choosing the most beneficial cuboids (i.e., combinations of dimensions) to materialize giv...
Kenneth A. Ross, Kazi A. Zaman
VLDB
1990
ACM
77views Database» more  VLDB 1990»
13 years 11 months ago
Efficient Main Memory Data Management Using the DBGraph Storage Model
Therequirementsfor amain memorydatastoragemodel are both compactnessand efficient processing for all database operations. The DBGraph storage model, proposed in this paper, achiev...
Philippe Pucheral, Jean-Marc Thévenin, Patr...
SIGMOD
2009
ACM
220views Database» more  SIGMOD 2009»
14 years 7 months ago
Keyword search in databases: the power of RDBMS
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
Lu Qin, Jeffrey Xu Yu, Lijun Chang
VLDB
1989
ACM
140views Database» more  VLDB 1989»
13 years 11 months ago
The Effect of Bucket Size Tuning in the Dynamic Hybrid GRACE Hash Join Method
In this paper, we show detailed analysis and performance evaluation of the Dynamic Hybrid GRACE Hash Join Method (DHGH Method) when the tuple distribution in buckets is unbalanced...
Masaru Kitsuregawa, Masaya Nakayama, Mikio Takagi
ICDE
1999
IEEE
94views Database» more  ICDE 1999»
14 years 9 months ago
Scalable Trigger Processing
Current database trigger systems have extremely limited scalability. This paper proposes a way to develop a truly scalable trigger system. Scalability to large numbers of trigger...
Eric N. Hanson, Chris Carnes, Lan Huang, Mohan Kon...