메뉴 건너뛰기




Volumn , Issue , 2012, Pages 138-145

Statement hypergraph as partitioning model for RDF data processing

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION OVERHEADS; DECOMPOSITION PROBLEMS; GRAPH PARTITIONING ALGORITHMS; GRID PARTITIONING; HYPERGRAPH PARTITIONING; PARALLEL AND DISTRIBUTED COMPUTING; PRE-PROCESSING STEP; VERTICAL PARTITIONING;

EID: 84876125167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APSCC.2012.73     Document Type: Conference Paper
Times cited : (3)

References (24)
  • 1
    • 57149122047 scopus 로고    scopus 로고
    • Column-stores vs. Rowstores: How different are they really?
    • ACM
    • D. J. Abadi, S. R. Madden, and N. Hachem. Column-stores vs. rowstores: How different are they really? In Proc. of SIGMOD 2008, pages 967-980. ACM, 2008.
    • (2008) Proc. of SIGMOD 2008 , pp. 967-980
    • Abadi, D.J.1    Madden, S.R.2    Hachem, N.3
  • 2
    • 33847103633 scopus 로고    scopus 로고
    • Multilevel algorithms for partitioning power-law graphs
    • IEEE Computer Society
    • A. Abou-Rjeili and G. Karypis. Multilevel algorithms for partitioning power-law graphs. In Proc. of IPDPS 2006, pages 124-124. IEEE Computer Society, 2006.
    • (2006) Proc. of IPDPS 2006 , pp. 124-124
    • Abou-Rjeili, A.1    Karypis, G.2
  • 3
    • 79957809015 scopus 로고    scopus 로고
    • HadoopDB: An architectural hybrid of MapReduce and DBMS technologies for analytical workloads
    • 2009
    • A. Abouzeid, K. Bajda-Pawlikowski, D. Abadi, A. Silberschatz, and A. Rasin. HadoopDB: An architectural hybrid of MapReduce and DBMS technologies for analytical workloads. Proc. of the VLDB 2009, 2(1):922-933, 2009.
    • (2009) Proc. of the VLDB , vol.2 , Issue.1 , pp. 922-933
    • Abouzeid, A.1    Bajda-Pawlikowski, K.2    Abadi, D.3    Silberschatz, A.4    Rasin, A.5
  • 4
    • 77954642549 scopus 로고    scopus 로고
    • Matrix bit loaded: A scalable lightweight join query processor for RDF data
    • ACM
    • M. Atre, V. Chaoji, M. J. Zaki, and J. A. Hendler. Matrix bit loaded: A scalable lightweight join query processor for RDF data. In Proc. of WWW 2010, pages 41-50. ACM, 2010.
    • (2010) Proc. of WWW 2010 , pp. 41-50
    • Atre, M.1    Chaoji, V.2    Zaki, M.J.3    Hendler, J.A.4
  • 5
    • 84876107357 scopus 로고    scopus 로고
    • BitMat: A main memory RDF triple store
    • Springer, Heidelberg
    • M. Atre, J. Srinivasan, and J. A. Hendler. BitMat: A main memory RDF triple store. In Proc. of SSWS 2009, pages 33-48. Springer, Heidelberg, 2009.
    • (2009) Proc. of SSWS 2009 , pp. 33-48
    • Atre, M.1    Srinivasan, J.2    Hendler, J.A.3
  • 6
    • 84866262574 scopus 로고    scopus 로고
    • Sesame: A generic architecture for storing and querying RDF and RDF schema
    • Springer, Heidelberg
    • J. Broekstra, A. Kampman, and F. van Harmelen. Sesame: A generic architecture for storing and querying RDF and RDF schema. In Proc. of ISWC 2002, pages 54-68. Springer, Heidelberg, 2002.
    • (2002) Proc. of ISWC 2002 , pp. 54-68
    • Broekstra, J.1    Kampman, A.2    Van Harmelen, F.3
  • 7
    • 34548058718 scopus 로고    scopus 로고
    • The SPARQL query graph model for query optimization
    • Springer, Heidelberg
    • O. Hartig and R. Heese. The SPARQL query graph model for query optimization. In Proc. of ESWC 2007, pages 564-578. Springer, Heidelberg, 2007.
    • (2007) Proc. of ESWC 2007 , pp. 564-578
    • Hartig, O.1    Heese, R.2
  • 8
    • 35048903560 scopus 로고    scopus 로고
    • Bipartite graphs as intermediate model for RDF
    • Springer, Heidelberg
    • J. Hayes and C. Gutierrez. Bipartite graphs as intermediate model for RDF. In Proc. of ISWC 2004, pages 47-61. Springer, Heidelberg, 2004.
    • (2004) Proc. of ISWC 2004 , pp. 47-61
    • Hayes, J.1    Gutierrez, C.2
  • 9
    • 84862700181 scopus 로고    scopus 로고
    • Scalable SPARQL querying of large RDF graphs
    • J. Huang, D. J. Abadi, and K. Ren. Scalable SPARQL querying of large RDF graphs. PVLDB, 4(11):1123-1134, 2011.
    • (2011) PVLDB , vol.4 , Issue.11 , pp. 1123-1134
    • Huang, J.1    Abadi, D.J.2    Ren, K.3
  • 10
    • 10444240843 scopus 로고    scopus 로고
    • Multi-constraint mesh partitioning for contact/impact computations
    • ACM
    • G. Karypis. Multi-constraint mesh partitioning for contact/impact computations. In Proc. of Supercomputing 2003, pages 1-11. ACM, 2003.
    • (2003) Proc. of Supercomputing 2003 , pp. 1-11
    • Karypis, G.1
  • 11
    • 4344697279 scopus 로고    scopus 로고
    • Resource description framework (RDF): Concepts and abstract syntax
    • G. Klyne and J. J. Carroll. Resource Description Framework (RDF): Concepts and abstract syntax. In W3C Recommendation. W3C, http://www.w3.org/TR/ 2004/REC-rdf-concepts-20040210/, 2004.
    • (2004) W3C Recommendation
    • Klyne, G.1    Carroll, J.J.2
  • 12
    • 84876112031 scopus 로고    scopus 로고
    • LUBM
    • LUBM. http://swat.cse.lehigh.edu/projects/lubm/.
  • 13
    • 84876142842 scopus 로고    scopus 로고
    • METIS
    • METIS. http://glaros.dtc.umn.edu/gkhome/views/metis.
  • 14
    • 46049097604 scopus 로고    scopus 로고
    • Architecture aware partitioning algorithms
    • pages
    • I. Moulitsas and G. Karypis. Architecture aware partitioning algorithms. In Proc. of ICA3PP 2008, pages 42-53, 2008.
    • (2008) Proc. of ICA3PP 2008 , pp. 42-53
    • Moulitsas, I.1    Karypis, G.2
  • 15
    • 75949108652 scopus 로고    scopus 로고
    • The RDF-3X engine for scalable management of RDF data
    • T. Neumann and G. Weikum. The RDF-3X engine for scalable management of RDF data. The VLDB Journal, 19(1):91-113, 2010.
    • (2010) The VLDB Journal , vol.19 , Issue.1 , pp. 91-113
    • Neumann, T.1    Weikum, G.2
  • 16
    • 80052789999 scopus 로고    scopus 로고
    • X-RDF-3X: Fast querying, high update rates, and consistency for RDF databases
    • T. Neumann and G. Weikum. x-RDF-3X: Fast querying, high update rates, and consistency for RDF databases. Proc. of the VLDB Endowment, 3(1-2):256-263, 2010.
    • (2010) Proc. of the VLDB Endowment , vol.3 , Issue.1-2 , pp. 256-263
    • Neumann, T.1    Weikum, G.2
  • 19
    • 33244466788 scopus 로고    scopus 로고
    • Multi-objective hypergraph partitioning algorithms for cut and maximum subdomain degree minimization
    • N. Selvakkumaran and G. Karypis. Multi-objective hypergraph partitioning algorithms for cut and maximum subdomain degree minimization. IEEE Transactions on CAD, (3):504-517, 2006.
    • (2006) IEEE Transactions on CAD , Issue.3 , pp. 504-517
    • Selvakkumaran, N.1    Karypis, G.2
  • 22
    • 84876107686 scopus 로고    scopus 로고
    • Linking open data on the semantic web
    • SWEO Community Project. Linking open data on the semantic web. http://www.w3.org/wiki/SweoIG/TaskForces/Community-Projects/LinkingOpenData.
    • SWEO Community Project
  • 23
    • 84859208444 scopus 로고    scopus 로고
    • Hexastore: Sextuple indexing for semantic web data management
    • C. Weiss, P. Karras, and A. Bernstein. Hexastore: Sextuple indexing for semantic web data management. Proc. of the VLDB Endowment, 1(1):1008-1019, 2008.
    • (2008) Proc. of the VLDB Endowment , vol.1 , Issue.1 , pp. 1008-1019
    • Weiss, C.1    Karras, P.2    Bernstein, A.3
  • 24
    • 57349146206 scopus 로고    scopus 로고
    • Jena property table implementation
    • K. Wilkinson. Jena property table implementation. In Proc. of SSWS 2006, pages 35-46, 2006.
    • (2006) Proc. of SSWS 2006 , pp. 35-46
    • Wilkinson, K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.