Sciweavers

1933 search results - page 134 / 387
» Query Containment Using Views
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 3 months 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
ADBIS
2000
Springer
169views Database» more  ADBIS 2000»
15 years 7 months ago
Data Organization Issues for Location-Dependent Queries in Mobile Computing
We consider queries which originate from a mobile unit and whose result depends on the location of the user who initiates the query. Example of such a query is How many people are ...
Sanjay Kumar Madria, Bharat K. Bhargava, Evaggelia...
COCO
1989
Springer
97views Algorithms» more  COCO 1989»
15 years 7 months ago
On the Structure of Bounded Queries to Arbitrary NP Sets
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
Richard Chang
CLEF
2010
Springer
15 years 4 months ago
DAEDALUS at LogCLEF 2010: Analyzing the Success of Search Queries
This paper describes the participation of DAEDALUS at the LogCLEF task. The focus of our experiments was to study if the difference between the native language of the user and the ...
Sara Lana-Serrano, Julio Villena-Román, Jos...
DPD
2002
114views more  DPD 2002»
15 years 2 months ago
Query Decomposition for a Distributed Object-Oriented Mediator System
The mediator-wrapper approach to integrate data from heterogeneous data sources has usually been centralized in the sense that a single mediator system is placed between a number o...
Vanja Josifovski, Tore Risch