Sciweavers

721 search results - page 65 / 145
» Layered Index Structures in Document Database Systems
Sort
View
111
Voted
VLDB
2001
ACM
66views Database» more  VLDB 2001»
15 years 8 months ago
An Evaluation of Generic Bulk Loading Techniques
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
Jochen Van den Bercken, Bernhard Seeger
153
Voted
CLUSTER
2005
IEEE
15 years 9 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
152
Voted
DOLAP
2005
ACM
15 years 5 months ago
Parallel querying of ROLAP cubes in the presence of hierarchies
Online Analytical Processing is a powerful framework for the analysis of organizational data. OLAP is often supported by a logical structure known as a data cube, a multidimension...
Frank K. H. A. Dehne, Todd Eavis, Andrew Rau-Chapl...
171
Voted
IKE
2003
15 years 5 months ago
A Tree-Based inverted File for Fast Ranked-Document Retrieval
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
Wann-Yun Shieh, Tien-Fu Chen, Chung-Ping Chung
122
Voted
INTERACT
2007
15 years 5 months ago
FaericWorld: Browsing Multimedia Events Through Static Documents and Links
This paper describes a novel browsing paradigm, taking benefit of the various types of links (e.g. thematic, temporal, references, etc.) that can be automatically built between mul...
Maurizio Rigamonti, Denis Lalanne, Rolf Ingold