Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Multimedia and complex data are usually queried by similarity predicates. Whereas there are many works dealing with algorithms to ansr basic similarity predicates, there are not generic algorithms able to efficiently handle similarity complex queries combining several basic similarity predicates. In this work  propose a simple and effective set of algorithms that can be combined to ansr complex similarity queries, and a set of algebraic rules useful to rewrite similarity query expressions into an adequate format for those algorithms. Those rules and algorithms allow relational database management systems to turn complex queries into efficient query execution plans.  present experiments that highlight interesting scenarios. They show that the proposed algorithms are orders of magnitude faster than the traditional similarity algorithms. Moreover, they are linearly scalable considering the database size.
['Caetano Traina', 'Agma J. M. Traina', 'Marcos R. Vieira', 'Adriano S. Arantes', 'Christos Faloutsos']
I am writing a research paper on a idea Efficient processing of complex similarity queries in RDBMS through query rewriting
[{"from": "human", "value": "I am writing a research paper on a idea Efficient processing of complex similarity queries in RDBMS through query rewriting"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Multimedia and complex data are usually queried by similarity predicates. Whereas there are many works dealing with algorithms to ansr basic similarity predicates, there are not generic algorithms able to efficiently handle similarity complex queries combining several basic similarity predicates. In this work  propose a simple and effective set of algorithms that can be combined to ansr complex similarity queries, and a set of algebraic rules useful to rewrite similarity query expressions into an adequate format for those algorithms. Those rules and algorithms allow relational database management systems to turn complex queries into efficient query execution plans.  present experiments that highlight interesting scenarios. They show that the proposed algorithms are orders of magnitude faster than the traditional similarity algorithms. Moreover, they are linearly scalable considering the database size."}]