613 search results - page 1 / 123 » Query Evaluation on a Database Given by a Random Graph |
ICDT
2007
ACM
14 years 5 months ago
2007
ACM
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
ICDE
2006
IEEE
15 years 6 days ago
2006
IEEE
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
DASFAA
2009
IEEE
14 years 2 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
SSDBM
2007
IEEE
14 years 5 months ago
2007
IEEE
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
APPROX
2008
Springer
14 years 26 days ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...