{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T21:28:49Z","timestamp":1765142929465,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405351"},{"type":"electronic","value":"9783540450726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45072-6_8","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T13:23:33Z","timestamp":1294493013000},"page":"122-139","source":"Crossref","is-referenced-by-count":2,"title":["Categorical Range Queries in Large Databases"],"prefix":"10.1007","author":[{"given":"Alexandros","family":"Nanopoulos","sequence":"first","affiliation":[]},{"given":"Panayiotis","family":"Bozanis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Acharya, S., Poosala, V., Ramaswamy, S.: Selectivity Estimation in Spatial Databases. In: Int. Conf. on Management of Data (SIGMOD 1999), pp. 13\u201324 (1999)","DOI":"10.1145\/304182.304184"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45749-6_6","volume-title":"Algorithms - ESA 2002","author":"P. Agarwal","year":"2002","unstructured":"Agarwal, P., Govindarajan, S., Muthukrishnan, S.: Range Searching in Categorical Data: Colored Range Searching on Grid. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 17\u201328. Springer, Heidelberg (2002)"},{"key":"8_CR3","unstructured":"Antoshenkov, G.: Random Sampling from Pseudo-ranked B\u2009+\u2009-trees. In: Int. Conf. on Very Large Databases (VLDB 1992), pp. 375\u2013382 (1992)"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Arge, L., Vitter, J.S.: Optimal Dynamic Interval Management in External Memory. In: Symp. on Foundations of Computer Science (FOCS 1996), pp. 560\u2013569 (1996)","DOI":"10.1109\/SFCS.1996.548515"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Arge, L., Samoladas, V., Vitter, J.S.: On Two-Dimensional Indexability and Optimal Range Search Indexing. In: Symp. on Principles of Database Systems (PODS 1999), pp. 346\u2013357 (1999)","DOI":"10.1145\/303976.304010"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1239\/aap\/1011994025","volume":"33","author":"A.D. Barbour","year":"2001","unstructured":"Barbour, A.D., Xia, A.: The number of two-dimensional maxima. Advanced Applications on Probability (SGSA)\u00a033, 727\u2013750 (2001)","journal-title":"Advanced Applications on Probability (SGSA)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R\u2009\u2217\u2009-Tree: An Efficient and Robust Access Method for Points and Rectangles. In: Int. Conf. on Management of Data (SIGMOD 1990), pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"8_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry","author":"M. Berg de","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry, 2nd edn. Springer, Heidelberg (2000)","edition":"2"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1007\/3-540-60084-1_97","volume-title":"Automata, Languages and Programming","author":"P. Bozanis","year":"1995","unstructured":"Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: New Upper Bounds for Generalized Intersection Searching Problems. In: F\u00fcl\u00f6p, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol.\u00a0944, pp. 464\u2013474. Springer, Heidelberg (1995)"},{"issue":"6","key":"8_CR10","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1093\/comjnl\/39.6.541","volume":"39","author":"P. Bozanis","year":"1996","unstructured":"Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: Red-Blue Intersection Reporting for Objects of Non-Constant Size. The Computer Journal\u00a039(6), 541\u2013546 (1996)","journal-title":"The Computer Journal"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1093\/comjnl\/40.1.22","volume":"40","author":"P. Bozanis","year":"1997","unstructured":"Bozanis, P., Kitsios, N., Makris, C., Tsakalidis, A.: New Results on Intersection Query Problems. The Computer Journal\u00a040(1), 22\u201329 (1997)","journal-title":"The Computer Journal"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Bozanis, P., Nanopoulos, A., Manolopoulos, Y.: LR-tree: a Logarithmic Decomposable Spatial Index Method. The Computer Journal (2003) (to appear)","DOI":"10.1093\/comjnl\/46.3.319"},{"issue":"2","key":"8_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/568518.568519","volume":"27","author":"N. Bruno","year":"2002","unstructured":"Bruno, N., Chaudhuri, S., Gravano, L.: Top-k selection queries over relational databases: Mapping strategies and performance evaluation. ACM Transactions on Database Systems\u00a027(2), 153\u2013187 (2002)","journal-title":"ACM Transactions on Database Systems"},{"key":"8_CR14","unstructured":"Eppstein, D., Muthukrishnan, S.: Internet packet filter management and rectangle geometry. In: Symp. on Discrete Algorithms (SODA 2001), pp. 827\u2013835 (2001)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Koudas, N., Muthukrishnan, S., Srivastava, D.: Two-dimensional Substring Indexing. In: Symp. on Principles of Database Systems (PODS 2001), pp. 282\u2013288 (2001)","DOI":"10.1145\/375551.375610"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-36285-1_10","volume-title":"Database Theory - ICDT 2003","author":"S. Govindarajan","year":"2002","unstructured":"Govindarajan, S., Agarwal, P.K., Arge, L.: CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 143\u2013157. Springer, Heidelberg (2002)"},{"issue":"2","key":"8_CR17","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1006\/jagm.1995.1038","volume":"19","author":"P. Gupta","year":"1995","unstructured":"Gupta, P., Janardan, R., Smid, M.: Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. Journal of Algorithms\u00a019(2), 282\u2013317 (1995)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195996000022","volume":"6","author":"P. Gupta","year":"1996","unstructured":"Gupta, P., Janardan, R., Smid, M.: Efficient Algorithms for Generalized Inter secion Searching on Non-Iso-oriented Objects. Computational Geometry: Theory & Applications\u00a06(1), 1\u201319 (1996)","journal-title":"Computational Geometry: Theory & Applications"},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/505241.505244","volume":"19","author":"J. Hellerstein","year":"2002","unstructured":"Hellerstein, J., Koutsoupias, E., Miranker, D., Papadimitriou, C., Samolodas, V.: On a Model of Indexability and Its Bounds for Range Queries. Journal of the ACM\u00a019(1), 35\u201355 (2002)","journal-title":"Journal of the ACM"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1142\/S021819599300004X","volume":"3","author":"R. Janardan","year":"1993","unstructured":"Janardan, R., Lopez, M.: Generalized intersection searching problems. Int. Journal on Computational Geometry and Applications\u00a03, 39\u201369 (1993)","journal-title":"Int. Journal on Computational Geometry and Applications"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Kanth, K., Ravada, S., Abugov, D.: Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data. In: Int. Conf. on Management of Data (SIGMOD 2002), pp. 546\u2013557 (2002)","DOI":"10.1145\/564691.564755"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0169-023X(00)00045-8","volume":"37","author":"Y. Manolopoulos","year":"2001","unstructured":"Manolopoulos, Y., Nardelli, E., Proietti, G., Tousidou, E.: A generalized comparison of linear representations of thematic layers. Data and Knowledge Engineering\u00a037(1), 1\u201323 (2001)","journal-title":"Data and Knowledge Engineering"},{"issue":"3-4","key":"8_CR23","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0925-7721(00)00021-3","volume":"17","author":"D. Mount","year":"2000","unstructured":"Mount, D., Netanyahu, N., Silverman, R., Wu, A.: Chromatic nearest neighbor searching: A query sensitive approach. Computational Geometry\u00a017(3-4), 97\u2013119 (2000)","journal-title":"Computational Geometry"},{"key":"8_CR24","unstructured":"Muthukrishnan, S.: Efficient algorithms for document retrieval problems. In: Symp. on Discrete Algorithms (SODA 2002), pp. 657\u2013666 (2002)"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Nanopoulos, A., Theodoridis, Y., Manolopoulos, Y.: An Efficient and Effective Algorithm for Density Biased Sampling. In: Int. Conf. on Information and Knowledge Management (CIKM 2002), pp. 63\u201368 (2002)","DOI":"10.1145\/584792.584858"},{"key":"8_CR26","volume-title":"The Design of Dynamic Data Structures","author":"M.H. Overmars","year":"1983","unstructured":"Overmars, M.H.: The Design of Dynamic Data Structures. Springer, Heidelberg (1983)"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Papadias, D., Tao, Y., Kalnis, P., Zhang, J.: Indexing Spatio-Temporal Data Warehouses. In: Int. Conf. on Data Engineering (ICDE 2002) (2002)","DOI":"10.1109\/ICDE.2002.994706"},{"volume-title":"Handbook of Computational Geometry","year":"2000","key":"8_CR28","unstructured":"Sack, J.R., Urrutia, J. (eds.): Handbook of Computational Geometry. North-Holland, Amsterdam (2000)"},{"key":"8_CR29","unstructured":"Tao, Y., Papadias, D.: The MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries. In: Intl. Conf. on Very Large Data Bases (VLDB 2001), pp. 431\u2013440 (2001)"}],"container-title":["Lecture Notes in Computer Science","Advances in Spatial and Temporal Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45072-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T15:07:40Z","timestamp":1740841660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45072-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405351","9783540450726"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45072-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}