{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T19:10:10Z","timestamp":1750792210618,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":29,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"US National Science Foundation","award":["IIS-1320078"],"award-info":[{"award-number":["IIS-1320078"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1145\/3105831.3105840","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T19:35:01Z","timestamp":1501270501000},"page":"153-160","source":"Crossref","is-referenced-by-count":2,"title":["Exploring Deletion Strategies for the BoND-Tree in Multidimensional Non-ordered Discrete Data Spaces"],"prefix":"10.1145","author":[{"given":"Ramblin","family":"Cherniak","sequence":"first","affiliation":[{"name":"Department of Computer and Information Science, The University of Michigan - Dearborn, Dearborn, Michigan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Zhu","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, The University of Michigan - Dearborn, Dearborn, Michigan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yarong","family":"Gu","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, The University of Michigan - Dearborn, Dearborn, Michigan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sakti","family":"Pramanik","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Michigan State University, East Lansing, Michigan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3105831.3105840-1","doi-asserted-by":"crossref","unstructured":"Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger. 1990. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data (SIGMOD '90). ACM, New York, NY, USA, 322--331. https:\/\/doi.org\/10.1145\/93597.98741","DOI":"10.1145\/93597.98741"},{"key":"key-10.1145\/3105831.3105840-2","unstructured":"Jon L. Bentley and Robert Sedgewick. 1997. Fast Algorithms for Sorting and Searching Strings. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '97). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 360--369. http:\/\/dl.acm.org\/citation.cfm?id=314161.314321"},{"key":"key-10.1145\/3105831.3105840-3","unstructured":"Stefan Berchtold, Daniel A. Keim, and Hans-Peter Kriegel. 1996. The X-tree: An Index Structure for High-Dimensional Data. In VLDB'96, Proceedings of 22th International Conference on Very Large Data Bases, September 3-6, 1996, Mumbai (Bombay), India, T. M. Vijayaraman, Alejandro P. Buchmann, C. Mohan, and Nandlal L. Sarda (Eds.). Morgan Kaufmann, 28--39."},{"key":"key-10.1145\/3105831.3105840-4","doi-asserted-by":"crossref","unstructured":"Tolga Bozkaya and Meral Ozsoyoglu. 1999. Indexing Large Metric Spaces for Similarity Search Queries. ACM Trans. Database Syst. 24, 3 (Sept. 1999), 361--404. https:\/\/doi.org\/10.1145\/328939.328959","DOI":"10.1145\/328939.328959"},{"key":"key-10.1145\/3105831.3105840-5","doi-asserted-by":"crossref","unstructured":"Edgar Chávez, Gonzalo Navarro, Ricardo Baeza-Yates, and José Luis Marroquín. 2001. Searching in Metric Spaces. ACM Comput. Surv. 33, 3 (Sept. 2001), 273--321. https:\/\/doi.org\/10.1145\/502807.502808","DOI":"10.1145\/502807.502808"},{"key":"key-10.1145\/3105831.3105840-6","doi-asserted-by":"crossref","unstructured":"Changqing Chen, Alok Watve, Sakti Pramanik, and Qiang Zhu. 2013. The BoND-Tree: An Efficient Indexing Method for Box Queries in Nonordered Discrete Data Spaces. IEEE Trans. on Knowl. and Data Eng. 25, 11 (Nov. 2013), 2629--2643. https:\/\/doi.org\/10.1109\/TKDE.2012.132","DOI":"10.1109\/TKDE.2012.132"},{"key":"key-10.1145\/3105831.3105840-7","unstructured":"Paolo Ciaccia, Marco Patella, and Pavel Zezula. 1997. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB '97). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 426--435. http:\/\/dl.acm.org\/citation.cfm?id=645923.671005"},{"key":"key-10.1145\/3105831.3105840-8","unstructured":"Julien ClÃl'ment, Philippe Flajolet, and Brigitte VallÃl'e. 1999. Dynamical Sources in Information Theory: A General Analysis of Trie Structures. ALGORITHMICA 29 (1999), 307--369."},{"key":"key-10.1145\/3105831.3105840-9","unstructured":"Yarong Gu, Qiang Zhu, Xianying Liu, Youchao Dong, C. Titus Brown, and Sakti Pramanik. 2016. Using disk based index and box queries for genome sequencing error correction. The International Society for Computers and Their Applications (ISCA), 69--76."},{"key":"key-10.1145\/3105831.3105840-10","doi-asserted-by":"crossref","unstructured":"Antonin Guttman. 1984. R-trees: A Dynamic Index Structure for Spatial Searching. In Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data (SIGMOD '84). ACM, New York, NY, USA, 47--57. https:\/\/doi.org\/10.1145\/602259.602266","DOI":"10.1145\/602259.602266"},{"key":"key-10.1145\/3105831.3105840-11","doi-asserted-by":"crossref","unstructured":"Andreas Henrich. 1998. The LSDh-Tree: An Access Structure for Feature Vectors. In Proceedings of the Fourteenth International Conference on Data Engineering (ICDE '98). IEEE Computer Society, Washington, DC, USA, 362--369. http:\/\/dl.acm.org\/citation.cfm?id=645483.656224","DOI":"10.1109\/ICDE.1998.655799"},{"key":"key-10.1145\/3105831.3105840-12","doi-asserted-by":"crossref","unstructured":"Gisli R. Hjaltason and Hanan Samet. 2003. Index-driven Similarity Search in Metric Spaces (Survey Article). ACM Trans. Database Syst. 28, 4 (Dec. 2003), 517--580. https:\/\/doi.org\/10.1145\/958942.958948","DOI":"10.1145\/958942.958948"},{"key":"key-10.1145\/3105831.3105840-13","doi-asserted-by":"crossref","unstructured":"A K. M. Tauhidul Islam, Sakti Pramanik, Xinge Ji, James R. Cole, and Qiang Zhu. 2015. Back Translated Peptide K-mer Search and Local Alignment in Large DNA Sequence Databases Using BoND-SD-tree Indexing. In Proceedings of the 2015 IEEE 15th International Conference on Bioinformatics and Bioengineering (BIBE) (BIBE '15). IEEE Computer Society, Washington, DC, USA, 1--6. https:\/\/doi.org\/10.1109\/BIBE.2015.7367638","DOI":"10.1109\/BIBE.2015.7367638"},{"key":"key-10.1145\/3105831.3105840-14","doi-asserted-by":"crossref","unstructured":"Jan Jannink. 1995. Implementing Deletion in B+-trees. SIGMOD Rec. 24, 1 (March 1995), 33--38. https:\/\/doi.org\/10.1145\/202660.202666","DOI":"10.1145\/202660.202666"},{"key":"key-10.1145\/3105831.3105840-15","doi-asserted-by":"crossref","unstructured":"Dashiell Kolbe, Qiang Zhu, and Sakti Pramanik. 2007. On k-nearest neighbor searching in non-ordered discrete data spaces. 426--435. https:\/\/doi.org\/10.1109\/ICDE.2007.367888","DOI":"10.1109\/ICDE.2007.367888"},{"key":"key-10.1145\/3105831.3105840-16","doi-asserted-by":"crossref","unstructured":"Dashiell Kolbe, Qiang Zhu, and Sakti Pramanik. 2010. Efficient K-nearest Neighbor Searching in Nonordered Discrete Data Spaces. ACM Trans. Inf. Syst. 28, 2, Article 7 (June 2010), 33 pages. https:\/\/doi.org\/10.1145\/1740592.1740595","DOI":"10.1145\/1740592.1740595"},{"key":"key-10.1145\/3105831.3105840-17","doi-asserted-by":"crossref","unstructured":"R. Maelbrancke and H. Olivié. 1995. Optimizing Jan Jannink's Implementation of B+-tree Deletion. SIGMOD Rec. 24, 3 (Sept. 1995), 5--7. https:\/\/doi.org\/10.1145\/211990.211999","DOI":"10.1145\/211990.211999"},{"key":"key-10.1145\/3105831.3105840-18","doi-asserted-by":"crossref","unstructured":"Alexandros Nanopoulos, Michael Vassilakopoulos, and Yannis Manolopoulos. 2003. Performance Evaluation of Lazy Deletion Methods in R-trees. Geoinformatica 7, 4 (Dec. 2003), 337--354. https:\/\/doi.org\/10.1023\/A:1025521422319","DOI":"10.1023\/A:1025521422319"},{"key":"key-10.1145\/3105831.3105840-19","doi-asserted-by":"crossref","unstructured":"Gonzalo Navarro and Nora Reyes. 2003. Improved Deletions in Dynamic Spatial Approximation Trees. In Proceedings of the XXIII International Conference of the Chilean Computer Science Society (SCCC '03). IEEE Computer Society, Washington, DC, USA, 13--22. http:\/\/dl.acm.org\/citation.cfm?id=950790.951316","DOI":"10.1109\/SCCC.2003.1245441"},{"key":"key-10.1145\/3105831.3105840-20","doi-asserted-by":"crossref","unstructured":"Gang Qian, Qiang Zhu, Qiang Xue, and Sakti Pramanik. 2003. The ND-tree: A Dynamic Indexing Technique for Multidimensional Non-ordered Discrete Data Spaces. In Proceedings of the 29th International Conference on Very Large Data Bases - Volume 29 (VLDB '03). VLDB Endowment, 620--631. http:\/\/dl.acm.org\/citation.cfm?id=1315451.1315505","DOI":"10.1016\/B978-012722442-8\/50061-6"},{"key":"key-10.1145\/3105831.3105840-21","doi-asserted-by":"crossref","unstructured":"Gang Qian, Qiang Zhu, Qiang Xue, and Sakti Pramanik. 2006. Dynamic Indexing for Multidimensional Non-ordered Discrete Data Spaces Using a Data-partitioning Approach. ACM Trans. Database Syst. 31, 2 (June 2006), 439--484. https:\/\/doi.org\/10.1145\/1138394.1138395","DOI":"10.1145\/1138394.1138395"},{"key":"key-10.1145\/3105831.3105840-22","doi-asserted-by":"crossref","unstructured":"Gang Qian, Qiang Zhu, Qiang Xue, and Sakti Pramanik. 2006. A Space-partitioning-based Indexing Method for Multidimensional Non-ordered Discrete Data Spaces. ACM Trans. Inf. Syst. 24, 1 (Jan. 2006), 79--110. https:\/\/doi.org\/10.1145\/1125857.1125860","DOI":"10.1145\/1125857.1125860"},{"key":"key-10.1145\/3105831.3105840-23","doi-asserted-by":"crossref","unstructured":"John T. Robinson. 1981. The K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indexes. In Proceedings of the 1981 ACM SIGMOD International Conference on Management of Data (SIGMOD '81). ACM, New York, NY, USA, 10--18. https:\/\/doi.org\/10.1145\/582318.582321","DOI":"10.1145\/582318.582321"},{"key":"key-10.1145\/3105831.3105840-24","doi-asserted-by":"crossref","unstructured":"Hanan Samet. 1980. Deletion in Two-dimensional Quad Trees. Commun. ACM 23, 12 (Dec. 1980), 703--710. https:\/\/doi.org\/10.1145\/359038.359043","DOI":"10.1145\/359038.359043"},{"key":"key-10.1145\/3105831.3105840-25","doi-asserted-by":"crossref","unstructured":"Hyun-Jeong Seok, Gang Qian, Qiang Zhu, Alexander R. Oswald, and Sakti Pramanik. 2008. Bulk-loading the ND-tree in Non-ordered Discrete Data Spaces. In Proceedings of the 13th International Conference on Database Systems for Advanced Applications (DASFAA'08). Springer-Verlag, Berlin, Heidelberg, 156--171. http:\/\/dl.acm.org\/citation.cfm?id=1802514.1802533","DOI":"10.1007\/978-3-540-78568-2_14"},{"key":"key-10.1145\/3105831.3105840-26","unstructured":"Hyun-Jeong Seok, Qiang Zhu, Gang Qian, Sakti Pramanik, and Wen-Chi Hou. 2009. Deletion Techniques for the ND-tree in Non-ordered Discrete Data Spaces. In 18th International Conference on Software Engineering and Data Engineering (SEDE-2009), June 22-24, 2009, Imperial Palace Hotel Las Vegas, Las Vegas, Nevada, USA, Proceedings. 1--6."},{"key":"key-10.1145\/3105831.3105840-27","doi-asserted-by":"crossref","unstructured":"Peter Weiner. 1973. Linear Pattern Matching Algorithms. In Proceedings of the 14th Annual Symposium on Switching and Automata Theory (Swat 1973) (SWAT '73). IEEE Computer Society, Washington, DC, USA, 1--11. https:\/\/doi.org\/10.1109\/SWAT.1973.13","DOI":"10.1109\/SWAT.1973.13"},{"key":"key-10.1145\/3105831.3105840-28","doi-asserted-by":"crossref","unstructured":"David A. White and Ramesh Jain. 1996. Similarity Indexing with the SS-tree. In Proceedings of the Twelfth International Conference on Data Engineering (ICDE '96). IEEE Computer Society, Washington, DC, USA, 516--523. http:\/\/dl.acm.org\/citation.cfm?id=645481.655573","DOI":"10.1109\/ICDE.1996.492202"},{"key":"key-10.1145\/3105831.3105840-29","unstructured":"Peter N. Yianilos. 1993. Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '93). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 311--321. http:\/\/dl.acm.org\/citation.cfm?id=313559.313789"}],"event":{"number":"21","sponsor":["Univ of the West of England, University of the West of England","BytePress","Concordia University"],"acronym":"IDEAS 2017","name":"the 21st International Database Engineering & Applications Symposium","start":{"date-parts":[[2017,7,12]]},"location":"Bristol, United Kingdom","end":{"date-parts":[[2017,7,14]]}},"container-title":["Proceedings of the 21st International Database Engineering & Applications Symposium on - IDEAS 2017"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3105831.3105840","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3105840&ftid=1896556&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T18:41:46Z","timestamp":1750790506000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3105831.3105840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1145\/3105831.3105840","relation":{},"subject":[],"published":{"date-parts":[[2017]]}}}