1 Ocak 2019 Konferans bildirisi Açık Erişim

Erdemir, Mert; Goz, Furkan; Mutlu, Alev; Karagoz, Pinar

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Erdemir, Mert</dc:creator>
  <dc:creator>Goz, Furkan</dc:creator>
  <dc:creator>Mutlu, Alev</dc:creator>
  <dc:creator>Karagoz, Pinar</dc:creator>
  <dc:date>2019-01-01</dc:date>
  <dc:description>Graph databases are gaining wide use as they provide flexible mechanisms to model real world entities and the relationships among them. In the literature, there exists several studies that evaluate performance of graph databases and graph database query languages. However, there is limited work on comparing performance for graph database querying under different graph representation models. In this study, we focus on two graph representation models: ordinary graphs vs. hyper-graphs, and investigate the querying performance of Neo4j for various query types under each model. The analysis conducted on a benchmark data set reveal what type of queries perform better on each representation.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/71227</dc:identifier>
  <dc:identifier>oai:zenodo.org:71227</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:title>Comparison of Querying Performance of Neo4j on Graph and Hyper-graph Data Model</dc:title>
  <dc:type>info:eu-repo/semantics/conferencePaper</dc:type>
  <dc:type>publication-conferencepaper</dc:type>
</oai_dc:dc>