Skip to main content
SpringerLink
Log in

Indexing for Graph Query Evaluation

  • Living reference work entry
  • First Online:
Book cover Encyclopedia of Big Data Technologies

  • 391 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  • Abadi DJ, Marcus A, Madden SR, Hollenbach K (2009) SW-Store: a vertically partitioned DBMS for semantic web data management. VLDB J 18(2):385–406

    Article  Google Scholar 

  • Atre M, Chaoji V, Zaki MJ, Hendler JA (2010) Matrix “Bit” loaded: a scalable lightweight join query processor for RDF data. In: WWW. ACM, pp 41–50

    Google Scholar 

  • Ching A, Edunov S, Kabiljo M, Logothetis D, Muthukrishnan S (2015) One trillion edges: graph processing at facebook-scale. PVLDB 8(12):1804–1815

    Article  Google Scholar 

  • Erling O, Mikhailov I (2009) Virtuoso: RDF support in a native RDBMS. In: SWIM, pp 501–519

    Google Scholar 

  • Fan W, Li J, Wang X, Wu Y (2012a) Query preserving graph compression. In: Proceedings of the ACM SIGMOD international conference on management of data, SIGMOD 2012, Scottsdale, 20–24 May 2012, pp 157–168

    Google Scholar 

  • Fan W, Wang X, Wu Y (2012b) Performance guarantees for distributed reachability queries. PVLDB 5(11):1304–1315

    Article  Google Scholar 

  • Fletcher G, Van Gucht D, Wu Y, Gyssens M, Brenes S, Paredaens J (2009) A methodology for coupling fragments of XPath with structural indexes for XML documents. Inf Syst 34(7):657–670

    Article  Google Scholar 

  • Fletcher G, Gyssens M, Leinders D, Van den Bussche J, Van Gucht D, Vansummeren S (2015) Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations. J Logic Comput 25(3):549–580

    Article  MathSciNet  Google Scholar 

  • Fletcher G, Gyssens M, Paredaens J, Van Gucht D, Wu Y (2016) Structural characterizations of the navigational expressiveness of relation algebras on a tree. J Comput Syst Sci 82(2):229–259

    Article  MathSciNet  Google Scholar 

  • Message Passing Interface Forum (2015) MPI: a message passing interface standard, version 3.1. https://www.mpi-forum.org/docs/mpi-3.1/mpi31-report.pdf

  • Gao S, Anyanwu K (2013) PrefixSolve: efficiently solving multi-source multi-destination path queries on RDF graphs by sharing suffix computations. In: WWW, pp 423–434

    Google Scholar 

  • Gubichev A, Bedathur SJ, Seufert S (2013) Sparqling Kleene: fast property paths in RDF-3X. In: GRADES, pp 14:1–14:7

    Google Scholar 

  • Gurajada S, Theobald M (2016) Distributed set reachability. In: SIGMOD, pp 1247–1261

    Google Scholar 

  • Gurajada S, Seufert S, Miliaraki I, Theobald M (2014) TriAD: a distributed shared-nothing RDF engine based on asynchronous message passing. In: SIGMOD, pp 289–300

    Google Scholar 

  • Harbi R, Abdelaziz I, Kalnis P, Mamoulis N (2015) Evaluating sparql queries on massive RDF datasets. Proc VLDB Endow 8(12):1848–1851. https://doi.org/10.14778/2824032.2824083

    Article  Google Scholar 

  • Harris S, Gibbins N (2003) 3store: efficient bulk RDF storage. In: PSSS, pp 1–15

    Google Scholar 

  • Harris S, Lamb N, Shadbolt N (2009) 4store: the design and implementation of a clustered RDF store. In: SSWS

    Google Scholar 

  • Hellings J, Fletcher G, Haverkort H (2012) Efficient external-memory bisimulation on DAGs. In: Proceedings of the ACM SIGMOD international conference on management of data, SIGMOD 2012, Scottsdale, 20–24 May 2012, pp 553–564

    Google Scholar 

  • Huang J, Abadi DJ, Ren K (2011) Scalable SPARQL querying of large RDF graphs. PVLDB 4(11): 1123–1134

    Google Scholar 

  • Lin J, Dyer C (2010) Data-intensive text processing with MapReduce. Synthesis lectures on human language technologies. Morgan & Claypool Publishers, San Rafael

    Article  Google Scholar 

  • Luo Y, Picalausa F, Fletcher GHL, Hidders J, Vansummeren S (2012) Storing and indexing massive RDF datasets. In: Virgilio RD, Guerra F, Velegrakis Y (eds) Semantic search over the web. Springer, Berlin/Heidelberg, pp 31–60. https://doi.org/10.1007/978-3-642-25008-8_2

    Chapter  Google Scholar 

  • Luo Y, de Lange Y, Fletcher G, De Bra P, Hidders J, Wu Y (2013a) Bisimulation reduction of big graphs on MapReduce. In: Big data – proceedings of 29th British National conference on databases, BNCOD 2013, Oxford, 8–10 July 2013, pp 189–203

    Chapter  Google Scholar 

  • Luo Y, Fletcher G, Hidders J, Wu Y, De Bra P (2013b) External memory k-bisimulation reduction of big graphs. In: 22nd ACM international conference on information and knowledge management, CIKM’13, San Francisco, 27 Oct–1 Nov 2013, pp 919–928

    Google Scholar 

  • Maccioni A, Abadi DJ (2016) Scalable pattern matching over compressed graphs via dedensification. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, San Francisco, 13–17 Aug 2016, pp 1755–1764

    Google Scholar 

  • Malewicz G, Austern MH, Bik AJC, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: SIGMOD, pp 135–146

    Google Scholar 

  • Maneth S, Peternek F (2016) Compressing graphs by grammars. In: 32nd IEEE international conference on data engineering, ICDE 2016, Helsinki, 16–20 May 2016, pp 109–120

    Google Scholar 

  • Milo T, Suciu D (1999) Index structures for path expressions. In: Database theory – ICDT’99, proceedings of 7th international conference, Jerusalem, 10–12 Jan 1999, pp 277–295

    Google Scholar 

  • Neumann T, Weikum G (2010a) The RDF-3X engine for scalable management of RDF data. VLDB J 19(1): 91–113

    Article  Google Scholar 

  • Neumann T, Weikum G (2010b) x-RDF-3X: fast querying, high update rates, and consistency for RDF databases. PVLDB 3:256–263

    Article  Google Scholar 

  • Peng P, Zou L, Özsu MT, Chen L, Zhao D (2016) Processing sparql queries over distributed RDF graphs. VLDB J 25(2):243–268. https://doi.org/10.1007/s00778-015-0415-0

    Article  Google Scholar 

  • Picalausa F, Luo Y, Fletcher G, Hidders J, Vansummeren S (2012) A structural approach to indexing triples. In: The semantic web: research and applications – proceedings of 9th extended semantic web conference, ESWC 2012, Heraklion, 27–31 May 2012, pp 406–421

    Google Scholar 

  • Picalausa F, Fletcher G, Hidders J, Vansummeren S (2014) Principles of guarded structural indexing. In: Proceedings of 17th international conference on database theory (ICDT), Athens, 24–28 Mar 2014, pp 245–256

    Google Scholar 

  • Potter A, Motik B, Nenov Y, Horrocks I (2016) Distributed RDF query answering with dynamic data exchange. In: ISWC, pp 480–497. https://doi.org/10.1007/978-3-319-46523-4_29

    Google Scholar 

  • Przyjaciel-Zablocki M, Schätzle A, Hornung T, Lausen G (2011) RDFPath: path query processing on large RDF graphs with MapReduce. In: ESWC, pp 50–64

    Google Scholar 

  • RDF (2014) Resource description framework. http://www.w3.org/RDF/

  • Rohloff K, Schantz RE (2011) Clause-iteration with MapReduce to scalably query datagraphs in the SHARD graph-store. In: DIDC, pp 35–44

    Google Scholar 

  • Sarwat M, Elnikety S, He Y, Mokbel MF (2013) Horton+: a distributed system for processing declarative reachability queries over partitioned graphs. PVLDB 6(14):1918–1929

    Article  Google Scholar 

  • Seufert S, Anand A, Bedathur SJ, Weikum G (2013) FERRARI: flexible and efficient reachability range assignment for graph indexing. In: ICDE, pp 1009–1020

    Google Scholar 

  • Sidirourgos L, Goncalves R, Kersten M, Nes N, Manegold S (2008) Column-store support for RDF data management: not all swans are white. PVLDB 1(2):1553–1563

    Article  Google Scholar 

  • SPA (2013) SPARQL 1.1 overview. https://www.w3.org/TR/sparql11-overview/

  • Su J, Zhu Q, Wei H, Yu JX (2017) Reachability querying: can it be even faster? IEEE Trans Knowl Data Eng 29(3):683–697

    Article  Google Scholar 

  • Then M, Kaufmann M, Chirigati F, Hoang-Vu T, Pham K, Kemper A, Neumann T, Vo HT (2014) The more the merrier: efficient multi-source graph traversal. PVLDB 8(4):449–460

    Article  Google Scholar 

  • Tian Y, Balmin A, Corsten SA, Tatikonda S, McPherson J (2013) From “think like a vertex” to “think like a graph”. PVLDB 7(3):193–204. http://www.vldb.org/pvldb/vol7/p193-tian.pdf

    Article  Google Scholar 

  • Tsialiamanis P, Sidirourgos L, Fundulaki I, Christophides V, Boncz PA (2012) Heuristics-based query optimisation for SPARQL. In: EDBT, pp 324–335

    Google Scholar 

  • Webber J (2012) A programmatic introduction to Neo4j. In: SPLASH, pp 217–218

    Google Scholar 

  • Weiss C, Karras P, Bernstein A (2008) Hexastore: sextuple indexing for semantic web data management. PVLDB 1(1):1008–1019

    Article  Google Scholar 

  • Xin RS, Gonzalez JE, Franklin MJ, Stoica I (2013) GraphX: a resilient distributed graph system on Spark. In: GRADES

    Google Scholar 

  • Yuan P, Liu P, Wu B, Jin H, Zhang W, Liu L (2013) TripleBit: a fast and compact system for large scale RDF data. PVLDB 6(7):517–528

    Article  Google Scholar 

  • Zaharia M, Chowdhury NMM, Franklin M, Shenker S, Stoica I (2010) Spark: cluster computing with working sets. Technical report UCB/EECS-2010-53, EECS Department, UC Berkeley, http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-53.html

  • Zeng K, Yang J, Wang H, Shao B, Wang Z (2013) A distributed graph engine for web scale RDF data. PVLDB 6(4):265–276

    Article  Google Scholar 

  • Zhang X, Chen L, Tong Y, Wang M (2013) EAGRE: towards scalable I/O efficient SPARQL query evaluation on the cloud. In: ICDE, pp 565–576

    Google Scholar 

  • Zou L, Mo J, Chen L, Özsu MT, Zhao D (2011) gStore: answering SPARQL queries via subgraph matching. PVLDB 4(8):482–493

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universiteit Eindhoven, Eindhoven, Netherlands

    George Fletcher

  2. Université du Luxembourg, Luxembourg, Luxembourg

    Martin Theobald

Authors
  1. George Fletcher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Theobald
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to George Fletcher .

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Tartu, Tartu, Estonia

    Sherif Sakr

  2. Sch of Info Techno, Building J12, University of Sydney Sch of Info Techno, Building J12, Sydney, Australia

    Albert Zomaya

Section Editor information

  1. Dresden Database Systems Group, Technische Universität Dresden, Dresden, Germany

    Hannes Voigt

  2. Department of Mathematics and Computer Science, Eindhoven University of Technology http://www.win.tue.nl/~gfletche/

    George Fletcher

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Fletcher, G., Theobald, M. (2018). Indexing for Graph Query Evaluation. In: Sakr, S., Zomaya, A. (eds) Encyclopedia of Big Data Technologies. Springer, Cham. https://doi.org/10.1007/978-3-319-63962-8_212-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-63962-8_212-1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-63962-8

  • Online ISBN: 978-3-319-63962-8

  • eBook Packages: Springer Reference MathematicsReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation