publication . Article . 2012

High-performance analysis of filtered semantic graphs

Buluç, A; Fox, A; Gilbert, JR; Kamil, S; Lugowski, A; Oliker, L; Williams, S;
Open Access
  • Published: 22 Oct 2012
  • Publisher: eScholarship, University of California
  • Country: Algeria
High performance is a crucial consideration when executing a complex analytic query on a massive semantic graph. In a semantic graph, vertices and edges carry \attributes" of various types. Analytic queries on semantic graphs typically depend on the values of these attributes; thus, the computation must either view the graph through a filter that passes only those individual vertices and edges of interest, or else must first materialize a subgraph or subgraphs consisting of only the vertices and edges of interest. The filtered approach is superior due to its generality, ease of use, and memory efficiency, but may carry a performance cost. In the Knowledge Discov...
free text keywords: Domain Specific Languages, Graph Analysis, SEJITS, KDT, High-performance computing
Related Organizations
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue