Sciweavers

493 search results - page 19 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
14 years 8 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
ICDE
2008
IEEE
200views Database» more  ICDE 2008»
14 years 8 months ago
Answering Keyword Queries on XML Using Materialized Views
Answering queries using materialized views has been well studied in the context of structured queries and has shown significant performance benefits. Despite the popularity of keyw...
Ziyang Liu, Yi Chen
ICDE
2007
IEEE
158views Database» more  ICDE 2007»
14 years 8 months ago
Efficient Evaluation of Imprecise Location-Dependent Queries
In location-based services, it is common for a user to issue a query based on his/her current position. One such example is "find the available cabs within two miles of my cu...
Jinchuan Chen, Reynold Cheng
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 9 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
SIGMOD
2007
ACM
112views Database» more  SIGMOD 2007»
14 years 7 months ago
A random walk approach to sampling hidden databases
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
Arjun Dasgupta, Gautam Das, Heikki Mannila