2635 search results - page 169 / 527 » Algorithms for the Database Layout Problem |
129
click to vote
ASUNAM
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
229
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Existing works in XML keyword search have addressed the problem of finding matching results of a query. However, user input queries always contain irrelevant or mismatched terms, ...
200
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
145
click to vote
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
135
click to vote
DASFAA
1999
IEEE
15 years 9 months ago
1999
IEEE
This paper addresses the recovery and the rollback problem in distributed collaborative transactions. We propose a solution to the problem in a generalized ARIES [9] framework. We...