With database management systems becoming complex, predicting the execution time of graph queries before they are executed is one of the challenges for query scheduling, workload management, resource allocation, and progress monitoring. Through the comparison of query performance prediction methods, existing research works have solved such problems in traditional SQL queries, but they cannot be directly applied in Cypher queries on the Neo4j database. Additionally, most query performance prediction methods focus on measuring the relationship between correlation coefficients and retrieval performance. Inspired by machine-learning methods and graph query optimization technologies, we used the RBF neural network as a prediction model to train ...
Predicting the performance of production code prior to actual execution is known to be highly challe...
Querying graph structured data is a fundamental operation that enables important applications includ...
Due to increasing growth of complex and dynamic linked data, there is becoming more and more databas...
A query optimizer attempts to predict a performance metric based on the amount of time elapsed. Theo...
Predicting the performance of a search engine for a given query is a fundamental and challenging tas...
Spark has gained growing attention in the past couple of years as an in-memory cloud computing platf...
Predicting query execution time is a fundamental issue underly-ing many database management tasks. E...
In recent years, cardinality estimation in query optimization has been a popular area of research. W...
Abstract—In this paper we address the problem of predicting SPARQL query performance. We use machine...
This report covers the implementation and evaluation of a Breadth-First Search operand for the Neo4j...
Graph databases employ graph structures such as nodes, attributes and edges to model and store relat...
Keyword query interfaces (KQIs) for databases provide easy access to data, but often su er from low...
International audienceWe address the problem of predicting SPARQL query performance. We use machine ...
Web search engines are built from components capable of processing large amounts of user queries per...
Query optimization is crucial for any data management system to achieve good performance. Recent adv...
Predicting the performance of production code prior to actual execution is known to be highly challe...
Querying graph structured data is a fundamental operation that enables important applications includ...
Due to increasing growth of complex and dynamic linked data, there is becoming more and more databas...
A query optimizer attempts to predict a performance metric based on the amount of time elapsed. Theo...
Predicting the performance of a search engine for a given query is a fundamental and challenging tas...
Spark has gained growing attention in the past couple of years as an in-memory cloud computing platf...
Predicting query execution time is a fundamental issue underly-ing many database management tasks. E...
In recent years, cardinality estimation in query optimization has been a popular area of research. W...
Abstract—In this paper we address the problem of predicting SPARQL query performance. We use machine...
This report covers the implementation and evaluation of a Breadth-First Search operand for the Neo4j...
Graph databases employ graph structures such as nodes, attributes and edges to model and store relat...
Keyword query interfaces (KQIs) for databases provide easy access to data, but often su er from low...
International audienceWe address the problem of predicting SPARQL query performance. We use machine ...
Web search engines are built from components capable of processing large amounts of user queries per...
Query optimization is crucial for any data management system to achieve good performance. Recent adv...
Predicting the performance of production code prior to actual execution is known to be highly challe...
Querying graph structured data is a fundamental operation that enables important applications includ...
Due to increasing growth of complex and dynamic linked data, there is becoming more and more databas...