메뉴 건너뛰기




Volumn , Issue , 2010, Pages 248-255

COSI: Cloud oriented subgraph identification in massive social networks

Author keywords

[No Author keywords available]

Indexed keywords

CLOUD COMPUTING; COMMUNICATION OVERHEADS; COMPLEX QUERIES; EDGE CUTS; EDGE WEIGHTS; GRAPH DATA; KEY OPERATIONS; NP COMPLETE; PROBABILISTIC METHODS; PROBABILITY ESTIMATE; QUERY GRAPH; REAL-WORLD; S-N DATA; SINGLE PROCESSORS; SOCIAL NETWORKS; SUBGRAPH MATCHING; SUBGRAPHS;

EID: 77958198433     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASONAM.2010.80     Document Type: Conference Paper
Times cited : (45)

References (17)
  • 1
    • 77958181456 scopus 로고    scopus 로고
    • DOGMA: A diskoriented graph matching algorithm for RDF databases
    • M. Bröcheler, A. Pugliese, and V. S. Subrahmanian, "DOGMA: A diskoriented graph matching algorithm for RDF databases, " in ISWC, 2009, pp. 97-113.
    • (2009) ISWC , pp. 97-113
    • Bröcheler, M.1    Pugliese, A.2    Subrahmanian, V.S.3
  • 2
    • 0002625423 scopus 로고    scopus 로고
    • From semistructured data to XML: Migrating the Lore data model and query language
    • R. Goldman, J. McHugh, and J. Widom, "From semistructured data to XML: migrating the Lore data model and query language, " in WebDB, 1999, pp. 25-30.
    • (1999) WebDB , pp. 25-30
    • Goldman, R.1    McHugh, J.2    Widom, J.3
  • 3
    • 0032131147 scopus 로고    scopus 로고
    • A fast and high quality multilevel scheme for partitioning irregular graphs
    • G. Karypis and V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs, " SIAM Journal on Scientific Computing, vol. 20, pp. 359-392, 1999.
    • (1999) SIAM Journal on Scientific Computing , vol.20 , pp. 359-392
    • Karypis, G.1    Kumar, V.2
  • 5
    • 77958155977 scopus 로고    scopus 로고
    • BerkeleyDB, "http://www.oracle.com/technology/products/berkeley-db. "
    • BerkeleyDB
  • 10
    • 70349107137 scopus 로고    scopus 로고
    • Evaluating very large datalog queries on social networks
    • R. Ronen and O. Shmueli, "Evaluating very large datalog queries on social networks, " in EDBT, 2009, pp. 577-587.
    • (2009) EDBT , pp. 577-587
    • Ronen, R.1    Shmueli, O.2
  • 12
    • 24944469847 scopus 로고    scopus 로고
    • Sesame: An architecture for storing and querying RDF data and schema information
    • J. Broekstra, A. Kampman, and F. van Harmelen, "Sesame: An architecture for storing and querying RDF data and schema information, " in Spinning the Semantic Web, 2003, pp. 197-222.
    • (2003) Spinning the Semantic Web , pp. 197-222
    • Broekstra, J.1    Kampman, A.2    Van Harmelen, F.3
  • 13
    • 15544368520 scopus 로고    scopus 로고
    • Efficient RDF storage and retrieval in Jena2
    • K. Wilkinson, C. Sayers, H. A. Kuno, and D. Reynolds, "Efficient RDF storage and retrieval in Jena2, " in SWDB, 2003, pp. 131-150.
    • (2003) SWDB , pp. 131-150
    • Wilkinson, K.1    Sayers, C.2    Kuno, H.A.3    Reynolds, D.4
  • 14
    • 85011081955 scopus 로고    scopus 로고
    • Scalable semantic Web data management using vertical partitioning
    • D. J. Abadi, A. Marcus, S. Madden, and K. J. Hollenbach, "Scalable semantic Web data management using vertical partitioning, " in VLDB, 2007, pp. 411-422.
    • (2007) VLDB , pp. 411-422
    • Abadi, D.J.1    Marcus, A.2    Madden, S.3    Hollenbach, K.J.4
  • 15
    • 84859172690 scopus 로고    scopus 로고
    • RDF-3X: A RISC-style engine for RDF
    • T. Neumann and G. Weikum, "RDF-3X: a RISC-style engine for RDF, " PVLDB, vol. 1, no. 1, pp. 647-659, 2008.
    • (2008) PVLDB , vol.1 , Issue.1 , pp. 647-659
    • Neumann, T.1    Weikum, G.2
  • 16
    • 33847064678 scopus 로고    scopus 로고
    • Optimized index structures for querying RDF from the Web
    • A. Harth and S. Decker, "Optimized index structures for querying RDF from the Web, " in LA-Web, 2005, pp. 71-80.
    • (2005) LA-Web , pp. 71-80
    • Harth, A.1    Decker, S.2
  • 17
    • 49949113751 scopus 로고    scopus 로고
    • YARS2: A federated repository for querying graph structured data from the web
    • A. Harth, J. Umbrich, A. Hogan, and S. Decker, "YARS2: A federated repository for querying graph structured data from the web, " in ISWC, 2007, pp. 211-224.
    • (2007) ISWC , pp. 211-224
    • Harth, A.1    Umbrich, J.2    Hogan, A.3    Decker, S.4


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