Sciweavers

2514 search results - page 143 / 503
» On the Computation of Approximations of Database Queries
Sort
View
JIDM
2010
160views more  JIDM 2010»
15 years 5 months ago
Evaluation of Conditional Preference Queries
The need for incorporating preference querying in database technology is a very important issue in a variety of applications ranging from e-commerce to personalized search engines....
Fabiola S. F. Pereira, Sandra de Amo
DBPL
1997
Springer
87views Database» more  DBPL 1997»
15 years 10 months ago
Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions
We examine the power of incremental evaluation systems that use an SQL-like language for maintaining recursively-de ned views. We show that recursive queries such as transitive clo...
Leonid Libkin, Limsoon Wong
SIGMOD
2005
ACM
116views Database» more  SIGMOD 2005»
16 years 6 months ago
ProDA: a suite of web-services for progressive data analysis
Online Scientific Applications (OSA) require statistical analysis of large multidimensional datasets. Towards this end, we have designed and developed a data storage and retrieval...
Mehrdad Jahangiri, Cyrus Shahabi
ICDE
2010
IEEE
171views Database» more  ICDE 2010»
16 years 6 months ago
Surrogate Ranking for Very Expensive Similarity Queries
1 We consider the problem of similarity search in applications where the cost of computing the similarity between two records is very expensive, and the similarity measure is not a...
Chris Jermaine, Fei Xu, Mingxi Wu, Ravi Jampani, T...
JAL
2007
95views more  JAL 2007»
15 years 6 months ago
Computing shortest paths with uncertainty
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
Tomás Feder, Rajeev Motwani, Liadan O'Calla...