Sciweavers

932 search results - page 62 / 187
» Where in the Wikipedia Is That Answer
Sort
View
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
14 years 9 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
WISE
2007
Springer
14 years 3 months ago
On Tree Pattern Query Rewriting Using Views
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
Junhu Wang, Jeffrey Xu Yu, Chengfei Liu
CLEF
2009
Springer
13 years 10 months ago
Information Retrieval Baselines for the ResPubliQA Task
This paper describes the baselines proposed for the ResPubliQA 2009 task. These baselines are purely based on information retrieval techniques. The selection of an adequate retrie...
Joaquín Pérez-Iglesias, Guillermo Ga...
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
13 years 9 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
SIGMOD
2004
ACM
105views Database» more  SIGMOD 2004»
14 years 9 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...