2514 search results - page 266 / 503 » On the Computation of Approximations of Database Queries |
163
Voted
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
290
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
184
click to vote
IS
2007
15 years 6 months ago
2007
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
183
click to vote
WEBDB
2005
Springer
16 years 5 days ago
2005
Springer
Querying document-centric XML collections with structure conditions improves retrieval precisions. The structures of such XML collections, however, are often too complex for users...
178
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Since the 1970’s, database systems have been “compute-centric”. When a computation needs the data, it requests the data, and the data are pulled through the system. We belie...