Matches in SemOpenAlex for { <https://semopenalex.org/work/W2912390524> ?p ?o ?g. }
Showing items 1 to 56 of
56
with 100 items per page.
- W2912390524 abstract "A data structure called a graph consists of nodes and edges; a node represents an entity in data, and an edge represents a relationship between two entities. Moreover, graphs accepting the property graph model (PGM) can provide information such as a person's gender, age, home address. All graph database (GDB) generally support this graph model. Conventional GDBs cannot avoid scanning all the nodes or specified labeled ones from the database when the clients issue a query. This process is not efficient because queries scan unnecessary nodes when an executing a query that has conditions that it uses properties of graph components. In order to resolve this problem, we analyze how node and edge properties can be queried more efficiently while maintaining the structure of the graph. Therefore, in this study, we just propose an approach for graph data management, which separately stores nodes/edges information and property information into separate data structures. In addition, we describe a plan for conducting an evaluation of our approach because it is the proposal stage." @default.
- W2912390524 created "2019-02-21" @default.
- W2912390524 creator A5018935948 @default.
- W2912390524 creator A5040144882 @default.
- W2912390524 date "2018-12-01" @default.
- W2912390524 modified "2023-09-24" @default.
- W2912390524 title "Combining Two Types of Database System for Managing Property Graph Data" @default.
- W2912390524 cites W1749271337 @default.
- W2912390524 cites W2118791211 @default.
- W2912390524 cites W2170069186 @default.
- W2912390524 doi "https://doi.org/10.1109/bigdata.2018.8622050" @default.
- W2912390524 hasPublicationYear "2018" @default.
- W2912390524 type Work @default.
- W2912390524 sameAs 2912390524 @default.
- W2912390524 citedByCount "1" @default.
- W2912390524 countsByYear W29123905242023 @default.
- W2912390524 crossrefType "proceedings-article" @default.
- W2912390524 hasAuthorship W2912390524A5018935948 @default.
- W2912390524 hasAuthorship W2912390524A5040144882 @default.
- W2912390524 hasConcept C106891557 @default.
- W2912390524 hasConcept C124101348 @default.
- W2912390524 hasConcept C132525143 @default.
- W2912390524 hasConcept C176225458 @default.
- W2912390524 hasConcept C203776342 @default.
- W2912390524 hasConcept C22149727 @default.
- W2912390524 hasConcept C41008148 @default.
- W2912390524 hasConcept C64339825 @default.
- W2912390524 hasConcept C77088390 @default.
- W2912390524 hasConcept C80444323 @default.
- W2912390524 hasConceptScore W2912390524C106891557 @default.
- W2912390524 hasConceptScore W2912390524C124101348 @default.
- W2912390524 hasConceptScore W2912390524C132525143 @default.
- W2912390524 hasConceptScore W2912390524C176225458 @default.
- W2912390524 hasConceptScore W2912390524C203776342 @default.
- W2912390524 hasConceptScore W2912390524C22149727 @default.
- W2912390524 hasConceptScore W2912390524C41008148 @default.
- W2912390524 hasConceptScore W2912390524C64339825 @default.
- W2912390524 hasConceptScore W2912390524C77088390 @default.
- W2912390524 hasConceptScore W2912390524C80444323 @default.
- W2912390524 hasLocation W29123905241 @default.
- W2912390524 hasOpenAccess W2912390524 @default.
- W2912390524 hasPrimaryLocation W29123905241 @default.
- W2912390524 hasRelatedWork W1550302283 @default.
- W2912390524 hasRelatedWork W2076417830 @default.
- W2912390524 hasRelatedWork W2111479807 @default.
- W2912390524 hasRelatedWork W2245059056 @default.
- W2912390524 hasRelatedWork W2784290212 @default.
- W2912390524 hasRelatedWork W2912390524 @default.
- W2912390524 hasRelatedWork W2972311463 @default.
- W2912390524 hasRelatedWork W3173549305 @default.
- W2912390524 hasRelatedWork W4293160369 @default.
- W2912390524 hasRelatedWork W4300908983 @default.
- W2912390524 isParatext "false" @default.
- W2912390524 isRetracted "false" @default.
- W2912390524 magId "2912390524" @default.
- W2912390524 workType "article" @default.