Extending SPARQL to support entity grouping and path queries

Amin Beheshti; Sherif Sakr; Boualem Benatallah; Hamid Reza Motahari-Nezhad

doi:10.48550/arXiv.1211.5817

Extending SPARQL to support entity grouping and path queries

Amin Beheshti, Sherif Sakr, Boualem Benatallah, Hamid Reza Motahari-Nezhad

Research output: Working paper › Preprint

Abstract

The ability to efficiently find relevant subgraphs and paths in a large graph to a given query is important in many applications including scientific data analysis, social networks, and business intelligence. Currently, there is little support and no efficient approaches for expressing and executing such queries. This paper proposes a data model and a query language to address this problem. The contributions include supporting the construction and selection of: (i) folder nodes, representing a set of related entities, and (ii) path nodes, representing a set of paths in which a path is the transitive relationship of two or more entities in the graph. Folders and paths can be stored and used for future queries. We introduce FPSPARQL which is an extension of the SPARQL supporting folder and path nodes. We have implemented a query engine that supports FPSPARQL and the evaluation results shows its viability and efficiency for querying large graph datasets.

Original language	English
DOIs	https://doi.org/10.48550/arXiv.1211.5817
Publication status	Submitted - 21 Nov 2012
Externally published	Yes

Publication series

Name	arXiv

Access to Document

10.48550/arXiv.1211.5817Licence: Unspecified

Cite this

@techreport{98629d9e5b1c438c9c2f1ae5e294afee,

title = "Extending SPARQL to support entity grouping and path queries",

abstract = "The ability to efficiently find relevant subgraphs and paths in a large graph to a given query is important in many applications including scientific data analysis, social networks, and business intelligence. Currently, there is little support and no efficient approaches for expressing and executing such queries. This paper proposes a data model and a query language to address this problem. The contributions include supporting the construction and selection of: (i) folder nodes, representing a set of related entities, and (ii) path nodes, representing a set of paths in which a path is the transitive relationship of two or more entities in the graph. Folders and paths can be stored and used for future queries. We introduce FPSPARQL which is an extension of the SPARQL supporting folder and path nodes. We have implemented a query engine that supports FPSPARQL and the evaluation results shows its viability and efficiency for querying large graph datasets.",

author = "Amin Beheshti and Sherif Sakr and Boualem Benatallah and Motahari-Nezhad, {Hamid Reza}",

year = "2012",

month = nov,

day = "21",

doi = "10.48550/arXiv.1211.5817",

language = "English",

series = "arXiv",

type = "WorkingPaper",

}

TY - UNPB

T1 - Extending SPARQL to support entity grouping and path queries

AU - Beheshti, Amin

AU - Sakr, Sherif

AU - Benatallah, Boualem

AU - Motahari-Nezhad, Hamid Reza

PY - 2012/11/21

Y1 - 2012/11/21

N2 - The ability to efficiently find relevant subgraphs and paths in a large graph to a given query is important in many applications including scientific data analysis, social networks, and business intelligence. Currently, there is little support and no efficient approaches for expressing and executing such queries. This paper proposes a data model and a query language to address this problem. The contributions include supporting the construction and selection of: (i) folder nodes, representing a set of related entities, and (ii) path nodes, representing a set of paths in which a path is the transitive relationship of two or more entities in the graph. Folders and paths can be stored and used for future queries. We introduce FPSPARQL which is an extension of the SPARQL supporting folder and path nodes. We have implemented a query engine that supports FPSPARQL and the evaluation results shows its viability and efficiency for querying large graph datasets.

AB - The ability to efficiently find relevant subgraphs and paths in a large graph to a given query is important in many applications including scientific data analysis, social networks, and business intelligence. Currently, there is little support and no efficient approaches for expressing and executing such queries. This paper proposes a data model and a query language to address this problem. The contributions include supporting the construction and selection of: (i) folder nodes, representing a set of related entities, and (ii) path nodes, representing a set of paths in which a path is the transitive relationship of two or more entities in the graph. Folders and paths can be stored and used for future queries. We introduce FPSPARQL which is an extension of the SPARQL supporting folder and path nodes. We have implemented a query engine that supports FPSPARQL and the evaluation results shows its viability and efficiency for querying large graph datasets.

U2 - 10.48550/arXiv.1211.5817

DO - 10.48550/arXiv.1211.5817

M3 - Preprint

T3 - arXiv

BT - Extending SPARQL to support entity grouping and path queries

ER -

Extending SPARQL to support entity grouping and path queries

Abstract

Publication series

Access to Document

Fingerprint

Cite this