Sciweavers

6654 search results - page 1035 / 1331
» Querying Faceted Databases
Sort
View
197
Voted
SSDBM
2002
IEEE
128views Database» more  SSDBM 2002»
15 years 11 months ago
Compressing Bitmap Indexes for Faster Search Operations
In this paper, we study the effects of compression on bitmap indexes. The main operations on the bitmaps during query processing are bitwise logical operations such as AND, OR, N...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
VLDB
2001
ACM
121views Database» more  VLDB 2001»
15 years 11 months ago
Weaving Relations for Cache Performance
Relational database systems have traditionally optimzed for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted p...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 11 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
ICDE
2010
IEEE
176views Database» more  ICDE 2010»
15 years 11 months ago
Efficient fuzzy type-ahead search in TASTIER
TASTIER is a research project on the new information-access paradigm called type-ahead search, in which systems find answers to a keyword query on-the-fly as users type in the quer...
Guoliang Li, Shengyue Ji, Chen Li, Jiannan Wang, J...
VLDB
1999
ACM
174views Database» more  VLDB 1999»
15 years 11 months ago
Extending Practical Pre-Aggregation in On-Line Analytical Processing
On-Line Analytical Processing (OLAP) based on a dimensional view of data is being used increasingly for the purpose of analyzing very large amounts of data. To improve query perfo...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
« Prev « First page 1035 / 1331 Last » Next »