{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:04:33Z","timestamp":1729634673179,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icde.2003.1260884","type":"proceedings-article","created":{"date-parts":[[2005,4,12]],"date-time":"2005-04-12T14:25:04Z","timestamp":1113315904000},"page":"851-856","source":"Crossref","is-referenced-by-count":1,"title":["Spatial processing using oracle table functions"],"prefix":"10.1109","author":[{"given":"R.K.","family":"V. Kothuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Ravada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Weisheng Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1996.492202"},{"key":"ref30","article-title":"Algorithms and strategies for similarity retrieval","author":"white","year":"1996","journal-title":"Proc of the SPIE Conference"},{"key":"ref10","first-page":"396","article-title":"Spatial joins using r-trees: Breadth-first traversal with global optimizations","author":"huang","year":"1997","journal-title":"Proc 5th Int Conf Very Large Data Bases"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253347"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1145\/253262.253272","article-title":"Concurrency and recovery in GiST","author":"kornacker","year":"1997","journal-title":"Proc ACM SIGMOD Int Conf on Management of Data"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1997.582015"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01231606"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/99935.99949"},{"key":"ref16","article-title":"Indexing the distance: an efficient method to knn processing","author":"ooi","year":"2001","journal-title":"Proc 5th Int Conf Very Large Data Bases"},{"journal-title":"Oracle9i SQL Reference Documentation","article-title":"Parallel and Pipelined Table Functions","year":"2001","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223798"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276320"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/237661.237705"},{"key":"ref4","article-title":"A storage and access architecture for efficient query processing in spatial database systems","author":"brinkhoff","year":"1993","journal-title":"Symposium on Large Spatial Databases (SSD'93) LNCS 692"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58795-0_54"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/69.842249"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914864"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/69.75895"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/215206.215335"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref7","article-title":"A greedy algorithm for bulk loading R-trees","author":"garcia","year":"1998","journal-title":"Proc of ACM GIS"},{"key":"ref2","article-title":"The X-tree: An index structure for high dimensional data","author":"berchtold","year":"1996","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60159-7_6","article-title":"Ranking in spatial databases","author":"hjaltson","year":"1995","journal-title":"Symposium on Spatial Databases (SSD)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304240"},{"key":"ref22","article-title":"Quadtree and r-trees in oracle spatial: A comparison using gis data","author":"ravi kanth","year":"2002","journal-title":"Proc ACM SIGMOD Int Conf on Management of Data"},{"key":"ref21","article-title":"Efficient processing of large spatial queries using interior approximations","author":"ravi kanth","year":"2001","journal-title":"Symposium on Spatial and Temporal Databases (SSTD)"},{"article-title":"The design and analysis of spatial data structures","year":"1989","author":"samet","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0262-8856(87)90049-7"},{"key":"ref26","article-title":"Efficient join index based join processing; a clustering approach","author":"shekhar","year":"0","journal-title":"IEEE Trans on Knowledge and Data Engineering"},{"key":"ref25","first-page":"507","article-title":"The r+-tree: A dynamic index for multi-dimensional objects","volume":"13","author":"sellis","year":"1988","journal-title":"Proc 5th Int Conf Very Large Data Bases"}],"event":{"name":"19th International Conference on Data Engineering","acronym":"ICDE-03","location":"Bangalore, India"},"container-title":["Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8910\/28179\/01260884.pdf?arnumber=1260884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T18:13:27Z","timestamp":1497636807000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1260884\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/icde.2003.1260884","relation":{},"subject":[]}}