Sciweavers

486 search results - page 12 / 98
» Evaluating Top-k Queries over Web-Accessible Databases
Sort
View
ICDE
2010
IEEE
401views Database» more  ICDE 2010»
15 years 10 months ago
Continuous Query Evaluation over Distributed Sensor Networks
— In this paper1 we address the problem of processing continuous multi-join queries, over distributed data streams. Our approach makes use of existing work in the field of publi...
Oana Jurca, Sebastian Michel, Alexandre Herrmann, ...
PVLDB
2008
174views more  PVLDB 2008»
15 years 28 days ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
SYRCODIS
2007
92views Database» more  SYRCODIS 2007»
15 years 2 months ago
A Method for Evaluating Full-text Search Queries in Native XML Databases
In this paper we consider the problem of efficiently producing results for full-text keyword search queries over XML documents. We describe full-text search query semantics and pr...
Roman Pastukhov
MDM
2005
Springer
174views Communications» more  MDM 2005»
15 years 7 months ago
GPAC: generic and progressive processing of mobile queries over mobile data
This paper introduces a new family of Generic and Progressive algorithms (GPAC, for short) for continuous mobile queries over mobile objects. GPAC provides a general skeleton that...
Mohamed F. Mokbel, Walid G. Aref
ICDT
2003
ACM
121views Database» more  ICDT 2003»
15 years 6 months ago
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
Floris Geerts, Bart Kuijpers