E cient Storage and Retrieval of In-Memory Static Data

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Kapoor Anuj

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF ALGORITHMS AND COMPUTATION Year:2020 | Volume:52 | Issue:1 Page(s): 83-96

Download Full-Text

View:

155

Download:

Cites:

Information Journal Paper

Title

E cient Storage and Retrieval of In-Memory Static Data

Author(s)

Kapoor Anuj | Issue Writer Certificate

Keywords

static data

trie

search algorithm

composite in-dex

combination key

Abstract

Hash or B-Tree based composite indexes, are the two most commonly used techniques for searching and re-trieving data from memory. Although these techniques have a serious memory limitation, that restricts free-dom to search by any combination of single key/data attribute, that comprises the composite search key, the techniques are still accepted considering the trade o s with better performance on insert and update opera-tions. But when the data is semi-static, which does not change often, there is a need and scope for a better tech-nique that provides the exibility and freedom to e-ciently search by any possible key, without creating any composite index. This paper explains such algorithmic technique along with its data structures.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Kapoor, Anuj. (2020). E cient Storage and Retrieval of In-Memory Static Data. JOURNAL OF ALGORITHMS AND COMPUTATION, 52(1), 83-96. SID. https://sid.ir/paper/354598/en

Vancouver: Copy

Kapoor Anuj. E cient Storage and Retrieval of In-Memory Static Data. JOURNAL OF ALGORITHMS AND COMPUTATION[Internet]. 2020;52(1):83-96. Available from: https://sid.ir/paper/354598/en

IEEE: Copy

Anuj Kapoor, “E cient Storage and Retrieval of In-Memory Static Data,” JOURNAL OF ALGORITHMS AND COMPUTATION, vol. 52, no. 1, pp. 83–96, 2020, [Online]. Available: https://sid.ir/paper/354598/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops