Sciweavers

2237 search results - page 425 / 448
» Storing information with extractors
Sort
View
FOCS
2000
IEEE
13 years 12 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
SIGMOD
2000
ACM
99views Database» more  SIGMOD 2000»
13 years 12 months ago
WSQ/DSQ: A Practical Approach for Combined Querying of Databases and the Web
We present WSQ/DSQ (pronounced “wisk-disk”), a new approach for combining the query facilities of traditional databases with existing search engines on the Web. WSQ, for Web-S...
Roy Goldman, Jennifer Widom
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
13 years 12 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
EDBT
2000
ACM
13 years 12 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
13 years 11 months ago
Compressing Relations and Indexes
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft