Space Efficient Top-k Query Encoding Based on Data Distribution 


Vol. 47,  No. 3, pp. 235-239, Mar.  2020
10.5626/JOK.2020.47.3.235


PDF

  Abstract

We consider an encoding that supports a range top-k query on a two-dimensional array without accessing the original array. We propose a more space-efficient encoding method for top-k query with better average-case query time. Our experiments also show that our encoding is more space-efficient than the earlier ones. Also, based on the learning-based data structure, we propose the use of the learning-based data structure on succinct data structures.


  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

W. Park and S. R. Satti, "Space Efficient Top-k Query Encoding Based on Data Distribution," Journal of KIISE, JOK, vol. 47, no. 3, pp. 235-239, 2020. DOI: 10.5626/JOK.2020.47.3.235.


[ACM Style]

Wooyoung Park and Srinivasa Rao Satti. 2020. Space Efficient Top-k Query Encoding Based on Data Distribution. Journal of KIISE, JOK, 47, 3, (2020), 235-239. DOI: 10.5626/JOK.2020.47.3.235.


[KCI Style]

박우영, 스리니바사 라오 사티, "데이터 분포 관찰을 통한 공간 효율적인 Top-k Query 인코딩," 한국정보과학회 논문지, 제47권, 제3호, 235~239쪽, 2020. DOI: 10.5626/JOK.2020.47.3.235.


[Endnote/Zotero/Mendeley (RIS)]  Download


[BibTeX]  Download



Search




Journal of KIISE

  • ISSN : 2383-630X(Print)
  • ISSN : 2383-6296(Electronic)
  • KCI Accredited Journal

Editorial Office

  • Tel. +82-2-588-9240
  • Fax. +82-2-521-1352
  • E-mail. chwoo@kiise.or.kr