Sciweavers

610 search results - page 20 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
15 years 11 months ago
Top-k Query Processing in Uncertain Databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditio...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
15 years 11 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel
ICDE
1995
IEEE
164views Database» more  ICDE 1995»
15 years 11 months ago
Efficient Processing of Nested Fuzzy SQL Queries
?In a fuzzy relational database where a relation is a fuzzy set of tuples and ill-known data are represented by possibility distributions, nested fuzzy queries can be expressed in ...
Qi Yang, Chengwen Liu, Jing Wu, Clement T. Yu, Son...
WWW
2008
ACM
15 years 10 months ago
Efficiently finding web services using a clustering semantic approach
Efficiently finding Web services on the Web is a challenging issue in service-oriented computing. Currently, UDDI is a standard for publishing and discovery of Web services, and U...
Jiangang Ma, Yanchun Zhang, Jing He
EDBT
2009
ACM
124views Database» more  EDBT 2009»
15 years 1 months ago
Processing probabilistic spatio-temporal range queries over moving objects with uncertainty
Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that...
Bruce S. E. Chung, Wang-Chien Lee, Arbee L. P. Che...