An Effective Path-aware Approach for Keyword Search over Data Graphs
سال انتشار: 1399
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 213
فایل این مقاله در 10 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JACET-6-3_005
تاریخ نمایه سازی: 18 فروردین 1400
چکیده مقاله:
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, which utilizes both the textual and structural features of answers in order to produce a more accurate order of answers. In addition, a query processing algorithm is developed based on information spreading technique to enumerate answers in approximate order. This algorithm is further improved by allowing a skewed development toward more promising paths and enables a more efficient processing of keyword queries. Performance evaluation through extensive experiments on a standard benchmark of three real-world datasets shows the effectiveness and efficiency of the proposed algorithms.Index Terms—Information retrieval, Database, Keyword search, Relevant answers, Information spreading.
کلیدواژه ها:
نویسندگان
Asieh Ghanbarpour
Department of Computer Engineering, University of Sistan and Baluchestan, Zahedan, Iran
Hassan Naderi
Computer Engineering Department, Iran University of Science and Technology (IUST), Tehran, Iran
Soheil ZareMotlagh
University of Sistan and Baluchestan, Zahedan, Iran