{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T13:50:06Z","timestamp":1673272206651},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:p>\n            Range queries based on\n            <jats:italic>L<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            distance are a common type of queries in multimedia databases containing feature vectors. We propose a novel approach that transforms the feature space into a new feature space such that range queries in the original space are mapped into equivalent box queries in the transformed space. Since box queries are axes aligned, there are several implementational advantages that can be exploited to speed up the retrieval of query results. For two dimensional data the transformation is precise. For greater than two dimensions we propose a space transformation scheme based on disjoint planer rotation, and along with pruning query box the results are precise. Experimental results with large synthetic databases and some real databases show the effectiveness of the proposed transformation scheme. These experimental results have been corroborated with appropriate mathematical models.\n          <\/jats:p>","DOI":"10.14778\/1920841.1920895","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"409-416","source":"Crossref","is-referenced-by-count":3,"title":["Transforming range queries to equivalent box queries to optimize page access"],"prefix":"10.14778","volume":"3","author":[{"given":"Sakti","family":"Pramanik","sequence":"first","affiliation":[{"name":"Michigan State University, East Lansing, MI"}]},{"given":"Alok","family":"Watve","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI"}]},{"given":"Chad R.","family":"Meiners","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI"}]},{"given":"Alex","family":"Liu","sequence":"additional","affiliation":[{"name":"Michigan State University, East Lansing, MI"}]}],"member":"320","published-online":{"date-parts":[[2010,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.383213"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_2_1_3_1","first-page":"28","volume-title":"Proceedings of the 22nd International Conference on VLDB","author":"Berchtold S.","year":"1996","unstructured":"S. Berchtold , D. Keim , and H.-P. Kriegel . The X-tree : an index structure for high-dimensional data . Proceedings of the 22nd International Conference on VLDB , pages 28 -- 39 , 1996 . S. Berchtold, D. Keim, and H.-P. Kriegel. The X-tree: an index structure for high-dimensional data. Proceedings of the 22nd International Conference on VLDB, pages 28--39, 1996."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/568518.568520"},{"key":"e_1_2_1_5_1","first-page":"426","volume-title":"VLDB '97: Proceedings of the 23rd International Conference on Very Large Data Bases","author":"Ciaccia P.","year":"1997","unstructured":"P. Ciaccia , M. Patella , and P. Zezula . M-tree: An efficient access method for similarity search in metric spaces . In VLDB '97: Proceedings of the 23rd International Conference on Very Large Data Bases , pages 426 -- 435 , San Francisco, CA, USA , 1997 . Morgan Kaufmann Publishers Inc. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB '97: Proceedings of the 23rd International Conference on Very Large Data Bases, pages 426--435, San Francisco, CA, USA, 1997. Morgan Kaufmann Publishers Inc."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958948"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391729.1391730"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253347"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.277778"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1949-9","volume-title":"Linear Algebra","author":"Lang S.","year":"1987","unstructured":"S. Lang . Linear Algebra . New York : Springer-Verlag , 1987 . S. Lang. Linear Algebra. New York: Springer-Verlag, 1987."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276320"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582321"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"e_1_2_1_15_1","unstructured":"http:\/\/download.oracle.com\/docs\/html\/B10829\\_01\/toc.htm. Oracle intermedia reference - 10g release 1(10.1).  http:\/\/download.oracle.com\/docs\/html\/B10829\\_01\/toc.htm. Oracle intermedia reference - 10g release 1(10.1)."},{"key":"e_1_2_1_16_1","unstructured":"http:\/\/www.cse.msu.edu\/~watvealo\/mysoftware.html. Web url for source code.  http:\/\/www.cse.msu.edu\/~watvealo\/mysoftware.html. Web url for source code."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/211359"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142532"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/645924.671192"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/645481.655573"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1920841.1920895","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:36:27Z","timestamp":1672227387000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1920841.1920895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.14778\/1920841.1920895"],"URL":"https:\/\/doi.org\/10.14778\/1920841.1920895","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}