Sciweavers

496 search results - page 63 / 100
» Machine models and lower bounds for query processing
Sort
View
CIKM
2006
Springer
13 years 11 months ago
Distributed spatio-temporal similarity search
In this paper we introduce the distributed spatio-temporal similarity search problem: given a query trajectory Q, we want to find the trajectories that follow a motion similar to ...
Demetrios Zeinalipour-Yazti, Song Lin, Dimitrios G...
SSDBM
2007
IEEE
105views Database» more  SSDBM 2007»
14 years 2 months ago
Window-Oblivious Join: A Data-Driven Memory Management Scheme for Stream Join
Memory management is a critical issue in stream processing involving stateful operators such as join. Traditionally, the memory requirement for a stream join is query-driven: a qu...
Ji Wu, Kian-Lee Tan, Yongluan Zhou
SIGIR
1999
ACM
14 years 1 days ago
Information Retrieval as Statistical Translation
We propose a new probabilistic approach to information retrieval based upon the ideas and methods of statistical machine translation. The central ingredient in this approach is a ...
Adam L. Berger, John D. Lafferty
EMNLP
2010
13 years 5 months ago
Learning Recurrent Event Queries for Web Search
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
Ruiqiang Zhang, Yuki Konda, Anlei Dong, Pranam Kol...
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 7 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...