2859 search results - page 235 / 572 » Querying Complex Structured Databases |
204
click to vote
CCR
2004
15 years 6 months ago
2004
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
183
click to vote
AAAI
2008
15 years 8 months ago
2008
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
306
click to vote
ICDE
2001
IEEE
16 years 7 months ago
2001
IEEE
Semi-join reducers were introduced in the late seventies as a means to reduce the communication costs of distributed database systems. Subsequent work in the eighties showed, howe...
288
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
158
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Large-scale websites are increasingly moving from relational databases to distributed key-value stores for high request rate, low latency workloads. Often this move is motivated n...