Logo des Repositoriums
 

Reverse Engineering Top-k Join Queries

Kurzanzeige
dc.contributor.authorPanev, Kiril
dc.contributor.authorWeisenauer, Nico
dc.contributor.authorMichel, Sebastian
dc.contributor.editorMitschang, Bernhard
dc.contributor.editorNicklas, Daniela
dc.contributor.editorLeymann, Frank
dc.contributor.editorSchöning, Harald
dc.contributor.editorHerschel, Melanie
dc.contributor.editorTeubner, Jens
dc.contributor.editorHärder, Theo
dc.contributor.editorKopp, Oliver
dc.contributor.editorWieland, Matthias
dc.date.accessioned2017-06-20T20:24:53Z
dc.date.available2017-06-20T20:24:53Z
dc.date.issued2017
dc.description.abstractRanked lists have become a fundamental tool to represent the most important items taken from a large collection of data. Search engines, sports leagues and e-commerce platforms present their results, most successful teams and most popular items in a concise and structured way by making use of ranked lists. This paper introduces the PALEO-J framework which is able to reconstruct top-k database queries, given only the original query output in the form of a ranked list and the database itself. The query to be reverse engineered may contain a wide range of aggregation functions and an arbitrary amount of equality joins, joining several database relations. The challenge of this work is to reconstruct complex queries as fast as possible while operating on large databases and given only the little amount of information provided by the top-k list of entities serving as input. The core contribution is identifying the join predicates in reverse engineering top-k OLAP queries. Furthermore we introduce several optimizations and an advanced classification system to reduce the execution time of the algorithm. Experiments conducted on a large database show the performance of the presented approach and confirm the benefits of our optimizations.en
dc.identifier.isbn978-3-88579-659-6
dc.identifier.pissn1617-5468
dc.language.isoen
dc.publisherGesellschaft für Informatik, Bonn
dc.relation.ispartofDatenbanksysteme für Business, Technologie und Web (BTW 2017)
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-265
dc.subjectdata exploration
dc.subjectreverse query processing
dc.titleReverse Engineering Top-k Join Queriesen
dc.typeText/Conference Paper
gi.citation.endPage70
gi.citation.startPage61
gi.conference.date6.-10. März 2017
gi.conference.locationStuttgart
gi.conference.sessiontitleQuery Processing and Languages

Dateien

Originalbündel
1 - 1 von 1
Vorschaubild
Name:
paper06.pdf
Größe:
640.64 KB
Format:
Adobe Portable Document Format
Herunterladen

Sammlungen

P265 - BTW2017 - Datenbanksysteme für Business, Technologie und Web