Sciweavers

2498 search results - page 221 / 500
» Data Structures with Unpredictable Timing
Sort
View
SIGMOD
1997
ACM
146views Database» more  SIGMOD 1997»
15 years 6 months ago
Concurrency and Recovery in Generalized Search Trees
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
Marcel Kornacker, C. Mohan, Joseph M. Hellerstein
KDD
2009
ACM
172views Data Mining» more  KDD 2009»
15 years 7 months ago
Learning dynamic temporal graphs for oil-production equipment monitoring system
Learning temporal graph structures from time series data reveals important dependency relationships between current observations and histories. Most previous work focuses on learn...
Yan Liu, Jayant R. Kalagnanam, Oivind Johnsen
146
Voted
DEBU
2002
161views more  DEBU 2002»
15 years 2 months ago
Indexing and Retrieval of Historical Aggregate Information about Moving Objects
Spatio-temporal databases store information about the positions of individual objects over time. In many applications however, such as traffic supervision or mobile communication ...
Dimitris Papadias, Yufei Tao, Jun Zhang, Nikos Mam...
CCCG
2008
15 years 4 months ago
Searching for Frequent Colors in Rectangles
We study a new variant of colored orthogonal range searching problem: given a query rectangle Q all colors c, such that at least a fraction of all points in Q are of color c, mus...
Marek Karpinski, Yakov Nekrich
SIGIR
2006
ACM
15 years 8 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber