T*-tree : An Efficient Indexing Technique for Main Memory Database
Vol. 21, No. 10, pp. 2597-2604, Oct. 1996
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.
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]
최공림, 김기룡, 김경창, "T*-tree : An Efficient Indexing Technique for Main Memory Database," The Journal of Korean Institute of Communications and Information Sciences, vol. 21, no. 10, pp. 2597-2604, 1996. DOI: .
[ACM Style]
최공림, 김기룡, and 김경창. 1996. T*-tree : An Efficient Indexing Technique for Main Memory Database. The Journal of Korean Institute of Communications and Information Sciences, 21, 10, (1996), 2597-2604. DOI: .
[KICS Style]
최공림, 김기룡, 김경창, "T*-tree : An Efficient Indexing Technique for Main Memory Database," The Journal of Korean Institute of Communications and Information Sciences, vol. 21, no. 10, pp. 2597-2604, 10. 1996.
pISSN : 1226 - 4717
eISSN : 2287 - 3880