Quantum-Inspired Keyword Search on Multi-model Databases

Show full item record



Permalink

http://hdl.handle.net/10138/333522

Citation

Yuan , G , Lu , J & SU , P 2021 , Quantum-Inspired Keyword Search on Multi-model Databases . in International Conference on Database Systems for Advanced Applications : DASFAA 2021: Database Systems for Advanced Applications . Lecture Notes in Computer Science , vol. 12682 , Springer , Cham , pp. 585-602 , International Conference on Database Systems for Advanced Applications , 11/04/2021 . https://doi.org/10.1007/978-3-030-73197-7_39

Title: Quantum-Inspired Keyword Search on Multi-model Databases
Author: Yuan, Gongsheng; Lu, Jiaheng; SU, Peifeng
Contributor: University of Helsinki, Department of Computer Science
University of Helsinki, Unified DataBase Management System research group / Jiaheng Lu
University of Helsinki, Department of Geosciences and Geography
Publisher: Springer
Date: 2021
Language: eng
Belongs to series: International Conference on Database Systems for Advanced Applications DASFAA 2021: Database Systems for Advanced Applications
Belongs to series: Lecture Notes in Computer Science
ISBN: 978-3-030-73196-0
978-3-030-73197-7
URI: http://hdl.handle.net/10138/333522
Abstract: With the rising applications implemented in different domains, it is inevitable to require databases to adopt corresponding appropriate data models to store and exchange data derived from various sources. To handle these data models in a single platform, the community of databases introduces a multi-model database. And many vendors are improving their products from supporting a single data model to being multi-model databases. Although this brings benefits, spending lots of enthusiasm to master one of the multi-model query languages for exploring a database is unfriendly to most users. Therefore, we study using keyword searches as an alternative way to explore and query multi-model databases. In this paper, we attempt to utilize quantum physics's probabilistic formalism to bring the problem into vector spaces and represent events (e.g., words) as subspaces. Then we employ a density matrix to encapsulate all the information over these subspaces and use density matrices to measure the divergence between query and candidate answers for finding top-k the most relevant results. In this process, we propose using pattern mining to identify compounds for improving accuracy and using dimensionality reduction for reducing complexity. Finally, empirical experiments demonstrate the performance superiority of our approaches over the state-of-the-art approaches.
Subject: 113 Computer and information sciences
Rights:


Files in this item

Total number of downloads: Loading...

Files Size Format View
paper_169.pdf 415.9Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record