{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:16:22Z","timestamp":1725473782470},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>There is an increasing demand from numerous applications such as bioinformatics and cybersecurity to efficiently process various types of queries on datasets in a multidimensional Non-ordered Discrete Data Space (NDDS). An NDDS consists of vectors with values coming from a non-ordered discrete domain for each dimension. The BoND-tree index was recently developed to efficiently process box queries on a large dataset from an NDDS on disk. The original work of the BoND-tree focused on developing the index construction and query algorithms. No work has been reported on exploring efficient and effective up- date strategies for the BoND-tree. In this paper, we study two update methods based on two different strategies for updating the index tree in an NDDS. Our study shows that using the bottom-up update method can provide improved efficiency, comparing to the traditional top-down update method, especially when the number of dimensions for a vector that need to be updated is small. On the other hand, our study also shows that the two update methods have a comparable effectiveness, which indicates that the bottom-up update method is generally more advantageous.<\/jats:p>","DOI":"10.29007\/3zq4","type":"proceedings-article","created":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T23:10:08Z","timestamp":1583795408000},"page":"122-109","source":"Crossref","is-referenced-by-count":0,"title":["A Study of Update Methods for BoND-Tree Index on Non-ordered Discrete Vector Data"],"prefix":"10.29007","volume":"69","author":[{"given":"Ramblin","family":"Cherniak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sakti","family":"Pramanik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"Proceedings of 35th International Conference on Computers and Their Applications"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T23:10:35Z","timestamp":1583795435000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/C4lK"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/3zq4","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}