Metraipolis › archive › dc_c0821072fdcf

Scaling Graph Query Processing: Focused Exploration on Partitions Using Load Balancing — arXiv:2610.32015

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.32015
License (as archived)
CC0-1.0
Archived
2026-10-26T19:54:41.810Z
SHA-256 of the archived text
b0b6995bc9c7a8cad879fb927338970ec4ebdeba51d9f292c318d5d6676e3989
Stable URL of this page
https://metraipolis.com/documento/dc_c0821072fdcf

How to cite

Scaling Graph Query Processing: Focused Exploration on Partitions Using Load Balancing — arXiv:2610.32015 — arXiv (en), https://arxiv.org/abs/2610.32015 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c0821072fdcf (Metraipolis archive dc_c0821072fdcf, sha256 b0b6995bc9c7a8cad879fb927338970ec4ebdeba51d9f292c318d5d6676e3989)
BibTeX
@misc{dcc0821072fdcf,
  title = {Scaling Graph Query Processing: Focused Exploration on Partitions Using Load Balancing — arXiv:2610.32015},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.32015},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c0821072fdcf; sha256 b0b6995bc9c7a8cad879fb927338970ec4ebdeba51d9f292c318d5d6676e3989},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.32015. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The focus of this paper is on query processing and not search (approximate or exact). The goal is to find all or k answers and the expressiveness of a query (as opposed to a search expression which is typically simpler) is considered important. Although SQL query processing has matured over the last several decades, query processing over graph data has not received the same attention. Only recently, systems, such as Neo4J, and others have started using graphs for data representation on a large scale. Their approaches and algorithms remain proprietary. In this paper, we address the problem of answering graph queries and their efficient processing on arbitrary-sized graphs. We propose the partitioning of graphs and the use of the distributed paradigm to achieve efficiency and scalability. Our approach takes a subgraph as query input including wild cards and comparison operations. Our partitioned approach leverages focused exploration and distributed processing to achieve the desired parallelism and improve the response time. We also present heuristics to reduce the number of partitions loaded for query processing. We present our partitioning algorithm, distributed processing architecture used, and load balancing for computing query answers. We establish the correctness of the approach in the presence of partitions, compare heuristics for load balancing, and extensive experimental results over large synthetic and real-world graph data sets.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Databases (cs.DB) ; Distributed, Parallel, and Cluster Computing (cs.DC); Information Retrieval (cs.IR).
Pagina del lavoro: https://arxiv.org/abs/2610.32015 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-26T19:46:03.303Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).