3020 search results - page 190 / 604 » Similarity Queries on Structured Data in Structured Overlays |
139
click to vote
ICDT
2007
ACM
16 years 24 days 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 α >...
164
click to vote
ICDCS
2007
IEEE
16 years 29 days ago
2007
IEEE
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
173
click to vote
PLDI
2004
ACM
16 years 2 days ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
136
click to vote
ADC
2009
Springer
16 years 1 months ago
2009
Springer
The paper presents the S.E.A.L. query language and interpreter for entity-association queries that allows such queries to be expressed in a much simpler way than in SQL. S.E.A.L (...
184
click to vote
FQAS
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...