Sciweavers

389 search results - page 10 / 78
» A skip-list approach for efficiently processing forecasting ...
Sort
View
PVLDB
2010
121views more  PVLDB 2010»
13 years 2 months ago
Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...
Deepak P, Prasad Deshpande
CIKM
2009
Springer
13 years 11 months ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck
SAC
2009
ACM
14 years 2 months ago
Adaptive burst detection in a stream engine
Detecting bursts in data streams is an important and challenging task. Due to the complexity of this task, usually burst detection cannot be formulated using standard query operat...
Marcel Karnstedt, Daniel Klan, Christian Pöli...
SIGMOD
2005
ACM
168views Database» more  SIGMOD 2005»
14 years 7 months ago
No pane, no gain: efficient evaluation of sliding-window aggregates over data streams
Window queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and c...
Jin Li, David Maier, Kristin Tufte, Vassilis Papad...
CAISE
2003
Springer
14 years 22 days ago
Processing Queries in a Large Peer-to-Peer System
While current search engines seem to easily handle the size of the data available on the Internet, they cannot provide fresh results. The most up-to-date data always resides on the...
Leonidas Galanis, Yuan Wang, Shawn R. Jeffery, Dav...