Sciweavers

1567 search results - page 43 / 314
» Compressing Relations and Indexes
Sort
View
CORR
2011
Springer
181views Education» more  CORR 2011»
13 years 4 months ago
Compressed String Dictionaries
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
Nieves R. Brisaboa, Rodrigo Cánovas, Miguel...
VLDB
2000
ACM
136views Database» more  VLDB 2000»
14 years 17 days ago
Managing Intervals Efficiently in Object-Relational Databases
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
VLDB
2005
ACM
120views Database» more  VLDB 2005»
14 years 2 months ago
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
Jost Enderle, Nicole Schneider, Thomas Seidl
JASIS
2006
90views more  JASIS 2006»
13 years 9 months ago
Can scientific journals be classified in terms of aggregated journal-journal citation relations using the Journal Citation Repor
The aggregated citation relations among journals included in the Science Citation Index provide us with a huge matrix which can be analyzed in various ways. Using principal compon...
Loet Leydesdorff
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 9 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...