Towards deeply intelligent interfaces in relational databases

buir.advisorUlusoy, Özgür
dc.contributor.authorUsta, Arif
dc.date.accessioned2021-08-19T10:35:29Z
dc.date.available2021-08-19T10:35:29Z
dc.date.copyright2021-08
dc.date.issued2021-08
dc.date.submitted2021-08-16
dc.descriptionCataloged from PDF version of article.en_US
dc.descriptionThesis (Ph.D.): Bilkent University, Department of Computer Engineering, İhsan Doğramacı Bilkent University, 2021.en_US
dc.descriptionIncludes bibliographical references (leaves 91-105).en_US
dc.description.abstractRelational databases is one of the most popular and broadly utilized infrastruc-tures to store data in a structured fashion. In order to retrieve data, users have to phrase their information need in Structured Query Language (SQL). SQL is a powerfully expressive and flexible language, yet one has to know the schema underlying the database on which the query is issued and to be familiar with SQL syntax, which is not trivial for casual users. To this end, we propose two different strategies to provide more intelligent user interfaces to relational databases by utilizing deep learning techniques. As the first study, we propose a solution for keyword mapping in Natural Language Interfaces to Databases (NLIDB), which aims to translate Natural Language Queries (NLQs) to SQL. We define the key-word mapping problem as a sequence tagging problem, and propose a novel deep learning based supervised approach that utilizes part-of-speech (POS) tags of NLQs. Our proposed approach, called DBTagger (DataBase Tagger), is an end-to-end and schema independent solution. Query recommendation paradigm, a well-known strategy broadly utilized in Web search engines, is helpful to suggest queries of expert users to the casual users to help them with their information need. As the second study, we propose Conquer, a CONtextual QUEry Recom-mendation algorithm on relational databases exploiting deep learning. First, we train local embeddings of a database using Graph Convolutional Networks to ex-tract distributed representations of the tuples in latent space. We represent SQL queries with a semantic vector by averaging the embeddings of the tuples returned as a result of the query. We employ cosine similarity over the final representations of the queries to generate recommendations, as a Witness-Based approach. Our results show that in classification accuracy of database rows as an indicator for embedding quality, Conquer outperforms state-of-the-art techniques.en_US
dc.description.provenanceSubmitted by Betül Özen (ozen@bilkent.edu.tr) on 2021-08-19T10:35:29Z No. of bitstreams: 1 10413725.pdf: 2618191 bytes, checksum: ff13a4003a81a34450631de1e4bb9824 (MD5)en
dc.description.provenanceMade available in DSpace on 2021-08-19T10:35:29Z (GMT). No. of bitstreams: 1 10413725.pdf: 2618191 bytes, checksum: ff13a4003a81a34450631de1e4bb9824 (MD5) Previous issue date: 2021-08en
dc.description.statementofresponsibilityby Arif Ustaen_US
dc.format.extentxi, 105 leaves : color charts ; 30 cm.en_US
dc.identifier.itemidB129158
dc.identifier.urihttp://hdl.handle.net/11693/76466
dc.language.isoEnglishen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectIntelligent user interfacesen_US
dc.subjectRelational databasesen_US
dc.subjectNLIDBen_US
dc.subjectKeyword mappingen_US
dc.subjectDeep learningen_US
dc.subjectGraph neural networksen_US
dc.subjectQuery recommendationen_US
dc.titleTowards deeply intelligent interfaces in relational databasesen_US
dc.title.alternativeİlişkisel veri tabanlarında derin akıllı araryüzler üzerineen_US
dc.typeThesisen_US
thesis.degree.disciplineComputer Engineering
thesis.degree.grantorBilkent University
thesis.degree.levelDoctoral
thesis.degree.namePh.D. (Doctor of Philosophy)

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
10413725.pdf
Size:
2.25 MB
Format:
Adobe Portable Document Format
Description:
Full printable version

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description: