Sciweavers

613 search results - page 54 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
103
Voted
IJIS
2002
112views more  IJIS 2002»
15 years 3 months ago
Extended possibilistic truth values
In search of semantic richer and more flexible database modelling and database querying techniques, different approaches based on fuzzy set theory have been developed. Among the m...
Guy De Tré
128
Voted
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 3 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
199
Voted
VLDB
2002
ACM
84views Database» more  VLDB 2002»
16 years 3 months ago
Views in a large-scale XML repository
We are interested in de ning and querying views in a huge and highly heterogeneous XML repository Web scale. In this context, view de nitions are very large and there is no appare...
Vincent Aguilera, Sophie Cluet, Tova Milo, Pierang...
145
Voted
CORR
2010
Springer
94views Education» more  CORR 2010»
15 years 2 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
157
Voted
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
16 years 3 months ago
Constraint-Based XML Query Rewriting For Data Integration
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
Cong Yu, Lucian Popa