Performance guarantees for distributed reachability queries

Proceedings of the VLDB Endowment

Volumn 5, Issue 11, 2012, Pages 1304-1315

  Fan, Wenfei ^a,b   Wang, Xin ^a   Wu, Yinghui ^a,c  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b HARBIN INSTITUTE OF TECHNOLOGY   (China)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED EVALUATION; NETWORK TRAFFIC; PARALLEL COMPUTATION; PARTIAL EVALUATION; PERFORMANCE GUARANTEES; REACHABILITY QUERIES; REAL LIFE DATA; REGULAR EXPRESSIONS;

EID: 84873134080     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2350229.2350248     Document Type: Article

References (32)

1. F. N. Afrati and J. D. Ullman. Optimizing joins in a map-reduce environment. In EDBT, pages 99-110, 2010.
2. V. L. Anh and A. Kiss. Efficient processing regular queries in shared-nothing parallel database systems using tree- and structural indexes. In ADBIS Research Communic, 2007.
3. P. Buneman, G. Cong, W. Fan, and A. Kementsietsidis. Using partial evaluation in distributed query evaluation. In VLDB, pages 211-222, 2006.
4. F. Chang et al. Bigtable: A distributed storage system for structured data. ACM Trans. Comput. Syst., 26(2), 2008.
5. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. SICOMP, 32(5):1338-1355, 2003.
6. G. Cong, W. Fan, and A. Kementsietsidis. Distributed query evaluation with performance guarantees. In SIGMOD, pages 509-520, 2007.
7. J. Dean and S. Ghemawat. Mapreduce: simplified data processing on large clusters. Commun. ACM, 51(1):107-113, 2008.
8. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: Amazon's highly available key-value store. In SOSP, pages 205-220, 2007.
9. B. F.Cooper et al. Pnuts: Yahoo!'s hosted data serving platform. PVLDB, 1(2):1277-1288, 2008.
10. P.-O. Fjällström. Algorithms for graph partitioning: A survey. Link̈oping Electronic Articles in Computer and Information Science, 3, 1998.
11. S. Flesca, F. Furfaro, and A. Pugliese. A framework for the partial evaluation of sparql queries. In SUM, pages 201-214, 2008.
12. A. Greenberg, J. Hamilton, D. A. Maltz, and P. Patel. The cost of a cloud: research problems in data center networks. SIGCOMM Comput. Commun. Rev., 39(1):68-73, 2008.
13. D. Gregor and A. Lumsdaine. Lifting sequential graph algorithms for distributed-memory parallel computation. In OOPSLA, pages 423-437, 2005.
14. J. F. Groote and M. Keinänen. A sub-quadratic algorithm for conjunctive and disjunctive boolean equation systems. In ICTAC, pages 532-545, 2005.
15. J. Hromkovic, S. Seibert, and T. Wilke. Translating regular expressions into small -free nondeterministic finite automata. J. Comput. Syst. Sci., 62(4):565-588, 2001.
16. M. F. Husain, P. Doshi, L. Khan, and B. M. Thuraisingham. Storage and retrieval of large RDF graph using hadoop and MapReduce. In CloudCom, pages 680-686, 2009.
17. M. Jamali. A distributed method for trust-aware recommendation in social networks. CoRR, abs/1011.2245, 2010.
18. N. D. Jones. An introduction to partial evaluation. ACM Comput. Surv., 28(3):480-503, 1996.
19. D. Kossmann. The state of the art in distributed query processing. ACM Comput. Surv., 32(4):422-469, 2000.
20. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph evolution: Densification and shrinking diameters. TKDD, 1(1):2, 2007.
21. G. Malewicz, M. H. Austern, A. J. C. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD, pages 135-146, 2010.
22. A. O. Mendelzon and P. T. Wood. Finding regular simple paths in graph databases. In VLDB, pages 185-193, 1989.
23. T. Milo and D. Deutch. Querying and monitoring distributed business processes. PVLDB, 1(2):1512-1515, 2008.
24. M. T. Ozsu and P. Valduriez. Principles of Distributed Database Systems. Prentice Hall, 1999.
25. J. M. Pujol, V. Erramilli, and P. Rodriguez. Divide and conquer: Partitioning online social networks. CoRR, abs/0905.4918, 2009.
26. B. Quilitz and U. Leser. Querying distributed RDF data sources with sparql. In ESWC, pages 524-538, 2008.
27. M. Rowe. Interlinking distributed social graphs. In Proceedings of Linked Data on the Web Workshop, WWW, 2009.
28. M. Sevalnev. From prefix computation on pram for finding euler tours to usage of hadoop-framework for distributed breadth first search. http://www.cs.hut.fi/.
29. M. Shoaran and A. Thomo. Fault-tolerant computation of distributed regular path queries. TCS, 410(1):62-77, 2009.
30. D. Suciu. Distributed query evaluation on semistructured data. TODS, 27(1):1-62, 2002.
31. J. X. Yu and J. Cheng. Graph reachability queries: A survey. In Managing and Mining Graph Data. Springer, 2010.
32. U. Zwick. Exact and approximate distances in graphs - a survey. In ESA, pages 33-48, 2001