Sciweavers

931 search results - page 128 / 187
» Storage and Querying of E-Commerce Data
Sort
View
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 10 months ago
SD-Rtree: A Scalable Distributed Rtree
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
Cédric du Mouza, Philippe Rigaux, Witold Li...
CIKM
2005
Springer
14 years 2 months ago
Static score bucketing in inverted indexes
Maintaining strict static score order of inverted lists is a heuristic used by search engines to improve the quality of query results when the entire inverted lists cannot be proc...
Chavdar Botev, Nadav Eiron, Marcus Fontoura, Ning ...
DOLAP
2007
ACM
14 years 26 days ago
OLAP preferences: a research agenda
Expressing preferences when querying databases is a natural way to avoid empty results and information flooding, and in general to rank results so that the user may first see the ...
Stefano Rizzi
SIGMOD
1991
ACM
104views Database» more  SIGMOD 1991»
14 years 13 days ago
Managing Persistent Objects in a Multi-Level Store
This paper presents an architecture for a persistent object store in which multi-level storage is explicitly included. Traditionally, DBMSs have assumed that all accessible data r...
Michael Stonebraker
AAAI
1997
13 years 10 months ago
Efficient Management of Very Large Ontologies
This paper describes an environment for supporting very large ontologies. The system can be used on single PCs, workstations, a cluster of workstations, and high-end parallel supe...
Kilian Stoffel, Merwyn G. Taylor, James A. Hendler