Sciweavers

789 search results - page 66 / 158
» On Theory Revision with Queries
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 5 days ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
ICUIMC
2011
ACM
14 years 3 months ago
Overhead analysis of query localization optimization and routing
Query localization is an improved extension of on-demand routing protocols for ad hoc networks. It makes use of prior routing histories to localize the query flood to a limited re...
Wenzheng Xu, Yongmin Zhang, Weifa Liang
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
14 years 2 months ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite
SIGIR
2006
ACM
15 years 5 months ago
A study of statistical models for query translation: finding a good unit of translation
This paper presents a study of three statistical query translation models that use different units of translation. We begin with a review of a word-based translation model that us...
Jianfeng Gao, Jian-Yun Nie
DOLAP
2004
ACM
15 years 5 months ago
Aggregate queries in peer-to-peer OLAP
A peer-to-peer (P2P) data management system consists essentially of a network of peer systems, each maintaining full autonomy over its own data resources. Data exchange between pe...
Mauricio Minuto Espil, Alejandro A. Vaisman