613 search results - page 57 / 123 » Query Evaluation on a Database Given by a Random Graph |
152
Voted
SSDBM
2008
IEEE
15 years 10 months ago
2008
IEEE
There are a lot of application domains, e.g. sensor databases, traffic management or recognition systems, where objects have to be compared based on vague and uncertain data. Feat...
149
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
146
Voted
JUCS
2010
14 years 10 months ago
2010
: We initiate in this work the study of a sort of redundancy problem revealed by what we call redundant relations. Roughly, we define a redundant relation in a database instance (d...
155
Voted
VLDB
2005
ACM
15 years 9 months ago
2005
ACM
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
114
Voted
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...