Boon Thau Loo University of California, Berkeley  Home/Search
Context Related
| berkeley.edu/techrepo...CSD041332.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: berkeley.edu/access...CSD041332 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper describes a distributed infrastructure for querying network graphs with recursive queries. We argue that recursive queries have great practical value as a declarative interface to multi-hop networks. To query these networks in a distributed fashion, we describe the processing of recursive queries using PIER, a P2P relational query processor that utilizes distributed hash tables (DHTs). We focus on studying a set of commonlyused recursive queries based on the transitive closure ... (Update)
Cited by: More
Querying and Routing in Next-Generation Networks - Loo (Correct)
Active bibliography (related documents): More All
1.0: Querying Network Graphs with Recursive Queries - Boon Thau Loo (2004) (Correct)
0.3: Analyzing P2P Pverlays with Recursive Queries - Loo, Huebsch, Hellerstein.. (2003) (Correct)
0.3: Analyzing P2P Overlays with Recursive Queries - Boon Thau Loo (2004) (Correct)
Similar documents based on text:
4.0: Unknown - (Correct)
Related documents from co-citation: More All
2: the expressive power of Datalog: tools and a case study - Kolaitis, Vardi - 1990
2: NIRA: A new Internet routing architecture (context) - YANG - 2003
2: Evaluation of Recursive Queries Using Join Indices (context) - Valduriez, Boral - 1986
BibTeX entry: (Update)
B. T. Loo. Querying Network Graphs with Recursive Queries. Technical Report UCB-CS-04-1332, UC Berkeley, 2004. http://citeseer.ist.psu.edu/loo04querying.html More
@misc{ loo04querying,
author = "B. Loo",
title = "Querying Network Graphs with Recursive Queries",
text = "B. T. Loo. Querying Network Graphs with Recursive Queries. Technical Report
UCB-CS-04-1332, UC Berkeley, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/loo04querying.html" }
Citations (may not include all citations):1225 Chord: A scalable peer-to-peer lookup service for internet a.. - Stoica, Morris et al. - 2001
222 Maintaining views incrementally (context) - Gupta, Mumick et al. - 1993
121 the Power of Magic - Beeri, Ramakrishnan - 1987
97 Eddies: continuously adaptive query processing - Avnur, Hellerstein - 2000
93 The Impact of DHT Routing Geometry on Resilience and Proximi.. - Gummadi, Gummadi et al. - 2003
88 Querying the Internet with PIER - Huebsch, Hellerstein et al. - 2003
50 A generalization of the differential approach to recursive q.. (context) - Balbin, Ramamohanarao - 1987
41 Aggregation and relevance in deductive databases - Sudarshan, Ramakrishnan - 1991
38 A survey of research on deductive database systems - Ramakrishnan, Ullman - 1993
38 Looking Up Data PP System - Karger, Stoica et al.
22 the computation of the transitive closure of relational oper.. (context) - Ioannidis - 1987
19 Evaluation of recursive queries using join indices (context) - Valduriez, BORAL - 1986
13 Structured Peer-to-Peer Overlays Need Application-Driven Ben.. - Rhea, Roscoe et al. - 2003
7 system for information portal generation and expert web sear.. (context) - Sizov, Biwer et al.
6 Distributed Web Crawling over DHTs - Loo, Krishnamurthy et al. - 2004
5 Building a Flexible and Efficient Routing Infrastructure: Ne.. (context) - Lakshminarayanan, Stoica et al. - 2001
4 Bottom-Up vs TopDown Revisited (context) - Ramakrishnan, Sudarshan - 1999
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC