Sciweavers

1039 search results - page 58 / 208
» Query reformulation with constraints
Sort
View
BIOINFORMATICS
2011
14 years 9 months ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....
ICDT
2009
ACM
119views Database» more  ICDT 2009»
16 years 6 months ago
Querying data sources that export infinite sets of views
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
Bogdan Cautis, Alin Deutsch, Nicola Onose
ICDE
2009
IEEE
165views Database» more  ICDE 2009»
16 years 7 months ago
Expressive Location-Based Continuous Query Evaluation with Binary Decision Diagrams
Many location-based services require rich and expressive query language support for filtering large amounts of information. In prominent location-based services thousands of conti...
Zhengdao Xu, Hans-Arno Jacobsen
VLDB
2001
ACM
151views Database» more  VLDB 2001»
16 years 6 months ago
Approximate query mapping: Accounting for translation closeness
Abstract In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is ch...
Kevin Chen-Chuan Chang, Hector Garcia-Molina
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
16 years 6 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea