2539 search results - page 392 / 508 » Updates for Structure Indexes |
126
click to vote
SIGMOD
1999
ACM
15 years 8 months ago
1999
ACM
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
146
click to vote
SIGMOD
1997
ACM
15 years 8 months ago
1997
ACM
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
165
click to vote
SWAT
1992
Springer
15 years 8 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
147
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
151
click to vote
ATMOS
2007
15 years 6 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...