Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Areas in which graph databases are applied ‐ such as the semantic b, social networks and scientific databases ‐ are prone to inconsistency, mainly due to interoperability issues. This raises the need for understanding query ansring over inconsistent graph databases in a framework that is simple yet general enough to accommodate many of its applications.  follow the ll-known approach of consistent query ansring (CQA), and study the data complexity of CQA over graph databases for regular path queries (RPQs) and regular path constraints (RPCs), which are frequently used.  concentrate on subset, superset and symmetric dierence repairs. Without further restrictions, CQA is undecidable for the semantics based on superset and symmetric dierence repairs, and P -complete for subset repairs. Hover,  provide several tractable restrictions on both RPCs and the structure of graph databases that lead to decidability, and even tractability of CQA.  also compare our results with those obtained for CQA in the context of relational databases. 1998 ACM Subject Classification H.2.3 Database Management - Query Languages
['Pablo Barceló', 'Gaëlle Fontaine']
I am writing a research paper on a idea On the Data Complexity of Consistent Query Answering over Graph Databases
[{"from": "human", "value": "I am writing a research paper on a idea On the Data Complexity of Consistent Query Answering over Graph Databases"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Areas in which graph databases are applied \u2010 such as the semantic b, social networks and scientific databases \u2010 are prone to inconsistency, mainly due to interoperability issues. This raises the need for understanding query ansring over inconsistent graph databases in a framework that is simple yet general enough to accommodate many of its applications.  follow the ll-known approach of consistent query ansring (CQA), and study the data complexity of CQA over graph databases for regular path queries (RPQs) and regular path constraints (RPCs), which are frequently used.  concentrate on subset, superset and symmetric dierence repairs. Without further restrictions, CQA is undecidable for the semantics based on superset and symmetric dierence repairs, and P -complete for subset repairs. Hover,  provide several tractable restrictions on both RPCs and the structure of graph databases that lead to decidability, and even tractability of CQA.  also compare our results with those obtained for CQA in the context of relational databases. 1998 ACM Subject Classification H.2.3 Database Management - Query Languages"}]