Search Results - Database query processing graph database

Neuro-Symbolic AI in Database Systems: A Systematic Review of Query Processing, Knowledge Graph Reasoning, Data Storage and Integration by Nzenwata, Uchenna Jeremiah, Ayankoya, Folasade Yetunde, Kuyoro, Shade Oluwakemi, Edwin, Emokiniovo

“… This review looks at how these two approaches work together to improve database systems in areas like query processing, knowledge graph reasoning, and data representation…”
Get full text

PimBeam: Efficient Regular Path Queries Over Graph Database Using Processing-in-Memory by Kong, Weihan, Zheng, Shengan, Hua, Yifan, Ma, Ruoyan, Wen, Yuheng, Wang, Guifeng, Zhou, Cong, Huang, Linpeng

“…Regular path queries (RPQs) in graph databases are bottlenecked by the memory wall…”
Get full text

A parallel query processing system based on graph-based database partitioning by Nam, Yoon-Min, Han, Donghyoung, Kim, Min-Soo

“…—despite their high data redundancy. We elucidate upon the drawbacks originating from the tree-based partitioning schemes and propose a novel graph-based database partitioning method called GPT that both improves the query performance…”
Get full text

A Unified Narrative for Query Processing in Graph Databases by Pang, Yue, Zou, Lei, Ozsu, M. Tamer

“…With the advent of graph data, graph databases have garnered significant research interest and efforts in recent years, especially with respect to graph query processing…”
Get full text

Fast Dual Simulation Processing of Graph Database Queries by Mennicke, Stephan, Kalo, Jan-Christoph, Nagel, Denis, Kroll, Hermann, Balke, Wolf-Tilo

“…Graph database query languages feature expressive yet computationally expensive pattern matching capabilities…”
Get full text

Data allocation optimization for query processing in graph databases using Lucene by Mathew, Anita Brigit

“… A novel storage mechanism for effective query processing must to be established in graph databases for minimizing time overhead…”
Get full text

Fast processing of graph queries on a large database of small and medium-sized data graphs by Pal, Dipali, Rao, Praveen, Slavov, Vasil, Katib, Anas

“…We propose a new way of indexing a large database of small and medium-sized graphs and processing exact subgraph matching…”
Get full text

A Graph-Based Database Partitioning Method for Parallel OLAP Query Processing by Yoon-Min Nam, Min-Soo Kim, Donghyoung Han

“…As the amount of data to process increases, a scalable and efficient horizontal database partitioning method becomes more important for OLAP query processing in parallel database platforms…”
Get full text

MSP: Multiple Sub-graph Query Processing using Structure-based Graph Partitioning Strategy and Map-Reduce by Shaik Fathimabi, R.B.V. Subramanyam, D.V.L.N. Somayajulu

“… Sub-graph query processing is a challenging problem in distributed environment. Centralized approaches proposed many algorithms, they mine frequent subgraphs from the graph database and construct an index which is very expensive…”
Get full text

On Processing Spatial Queries in Graph Database Management Systems by Sun, Yuhan

“…, graph or textual information, etc. Among all these compound spatial data, geospatial graph data is one of the most challenging for the complexity of graph data…”
Get full text

Accelerating Regular Path Queries over Graph Database with Processing-in-Memory by Ma, Ruoyan, Zheng, Shengan, Wang, Guifeng, Pu, Jin, Hua, Yifan, Wang, Wentao, Huang, Linpeng

“…Regular path queries (RPQs) in graph databases are bottlenecked by the memory wall…”
Get full text

Efficient algorithms for supergraph query processing on graph databases by Zhang, Shuo, Gao, Xiaofeng, Wu, Weili, Li, Jianzhong, Gao, Hong

“…We study the problem of processing supergraph queries on graph databases. A graph database D is a large set of graphs…”
Get full text

Mining and indexing graph databases by Yuan, Dayu

“… There are two common search scenarios: subgraph search and supergraph search. In a subgraph search, given a query graph q, the algorithm searches for all graphs that have q as a subgraph, from a graph database…”
Get full text

Framework for constructing multimodal transport networks and routing using a graph database: A case study in London by Park, Seula, Cheng, Tao

“… The constructed multimodal graph database showed stable performance in processing iterative queries, and efficient multi…”
Get full text

Accelerating Regular Path Queries over Graph Database with Processing-in-Memory by Ma, Ruoyan, Zheng, Shengan, Wang, Guifeng, Pu, Jin, Hua, Yifan, Wang, Wentao, Huang, Linpeng

“…Regular path queries (RPQs) in graph databases are bottlenecked by the memory wall…”
Get full text

The G graph database: efficiently managing large distributed dynamic graphs by Labouseur, Alan G., Birnbaum, Jeremy, Olsen, Paul W., Spillane, Sean R., Vijayan, Jayadevan, Hwang, Jeong-Hyon, Han, Wook-Shin

“… Modern analytics require systems capable of storing and processing series of graphs. We present such a system. G…”
Get full text

SGIR-Tree: Integrating R-Tree Spatial Indexing as Subgraphs in Graph Database Management Systems by Kim, Juyoung, Hong, Seoyoung, Jeong, Seungchan, Park, Seula, Yu, Kiyun

“…Efficient spatial query processing in Graph Database Management Systems (GDBMSs) has become increasingly important owing to the prevalence of spatial graph data…”
Get full text

US Patent Issued to The MITRE on Jan. 7 for "Methods and systems for natural language processing of graph database queries" (Maryland, Virginia Inventors)

Get full text

Secrecy and performance models for query processing on outsourced graph data by Suntaxi, Gabriela, El Ghazi, Aboubakr Achraf, Böhm, Klemens

“…Database outsourcing is a challenge concerning data secrecy. Even if an adversary, including the service provider, accesses the data, she should not be able to learn any information from the accessed data…”
Get full text

Fast Dual Simulation Processing of Graph Database Queries (Supplement) by Mennicke, Stephan, Jan-Christoph Kalo, Nagel, Denis, Kroll, Hermann, Wolf-Tilo Balke

“…Graph database query languages feature expressive, yet computationally expensive pattern matching capabilities…”
Get full text