2635 search results - page 290 / 527 » Algorithms for the Database Layout Problem |
232
click to vote
SSD
2001
Springer
15 years 11 months ago
2001
Springer
The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of object...
171
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
159
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
162
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
271
click to vote
VLDB
2008
ACM
16 years 6 months ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...