768 search results - page 28 / 154 » Efficient Correlation Search from Graph Databases |
107
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
117
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
100
click to vote
UAI
2008
15 years 1 months ago
2008
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
VLDB
1998
ACM
15 years 3 months ago
1998
ACM
Text data in the Internet can be partitioned into many databases naturally. Efficient retrieval of desired data can be achieved if we can accurately predict the usefulness of each...
CIKM
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we address the issue of continuous keyword queries on multiple textual streams. This line of work represents a significant departure from previous keyword search mod...