Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
TOP-K AND SKYLINE QUERY PROCESSING OVER RELATIONAL DATABASE
Jönköping University, School of Engineering, JTH. Research area Information Engineering.
2012 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Top-k and Skyline queries are a long study topic in database and information retrieval communities and they are two popular operations for preference retrieval. Top-k query returns a subset of the most relevant answers instead of all answers. Efficient top-k processing retrieves the k objects that have the highest overall score. In this paper, some algorithms that are used as a technique for efficient top-k processing for different scenarios have been represented. A framework based on existing algorithms with considering based cost optimization that works for these scenarios has been presented. This framework will be used when the user can determine the user ranking function. A real life scenario has been applied on this framework step by step.

Skyline query returns a set of points that are not dominated (a record x dominates another record y if x is as good as y in all attributes and strictly better in at least one attribute) by other points in the given datasets. In this paper, some algorithms that are used for evaluating the skyline query have been introduced. One of the problems in the skyline query which is called curse of dimensionality has been presented. A new strategy that based on the skyline existing algorithms, skyline frequency and the binary tree strategy which gives a good solution for this problem has been presented. This new strategy will be used when the user cannot determine the user ranking function. A real life scenario is presented which apply this strategy step by step.

Finally, the advantages of the top-k query have been applied on the skyline query in order to have a quickly and efficient retrieving results.

Place, publisher, year, edition, pages
2012. , 67 p.
Keyword [en]
Top-k query, Skyline query, Fagin’s algorithm, Threshold Algorithm, No random access algorithm, Minimal Probing algorithm, Block-Nested-Loop algorithm, Nearest Neighbor algorithm, Branch and Bound Skyline Algorithm, Divide and Conquer algorithm
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:hj:diva-20108OAI: oai:DiVA.org:hj-20108DiVA: diva2:577360
Uppsok
Technology
Supervisors
Examiners
Available from: 2013-01-03 Created: 2012-12-15 Last updated: 2013-01-03Bibliographically approved

Open Access in DiVA

TOP-K AND SKYLINE QUERY PROCESSING OVER RELATIONAL DATABASE(3199 kB)673 downloads
File information
File name FULLTEXT01.pdfFile size 3199 kBChecksum SHA-512
92acd11043c19d84444921c0ae523719b5ebe925a003c996d89893ed0084fa66236264711058fbbf3548bbcf65d630b7b163b4ff8e45c81e9de2f8cbd90b2429
Type fulltextMimetype application/pdf

By organisation
JTH. Research area Information Engineering
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 673 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 325 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf