Towards a framework for graph-based keyword search over relational data
by Vittoria Cozza
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 15, No. 2, 2022

Abstract: Keyword-based access to structured data has attracted research and industry as a means for facilitating access to information. In recent years, the research community and big data technology vendors put a lot of effort into developing new proof of concept systems for the task at hand. Two major limitations have been identified for such prototypes to transition into fully developed products: 1) systems are not designed to scale up; 2) the absence of a complete evaluation approach oriented towards effectiveness. This work presents a framework for supporting the development and the evaluation of graph-based keyword search systems. Furthermore, the implementation of a core module of this framework is detailed and shared open-source with the community.

Online publication date: Thu, 07-Apr-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com