Bkd-tree: A dynamic scalable kd-tree
- Author
- PROCOPIUC, Octavian1 ; AGARWAL, Pankaj K1 ; ARGE, Lars1 ; VITTER, Jeffrey Scott2
[1] Department of Computer Science, Duke University, Durham, NC 27708, United States
[2] Department of Computer Science, Purdue University, West Lafayette, IN 47907, United States - Conference title
- Advances in spatial and temporal databases (Santorini Island, 24-27 July 2003)
- Conference name
- SSTD 2003 : international symposium on advances in spatial and temporal databases (8 ; 2003-07-24)
- Author (monograph)
- Hadzilacos, Thanasis (Editor); Manolopoulos, Yannis (Editor); Roddick, John F (Editor); Theodoridi, Yannis (Editor)
- Source
Lecture notes in computer science. 2003, pp 46-65, 20 p ; ref : 25 ref
- ISSN
- 0302-9743
- ISBN
- 3-540-40535-6
- Scientific domain
- Documentation; Computer science
- Publisher
- Springer, Berlin
- Publication country
- Germany
- Document type
- Conference Paper
- Language
- English
- Keyword (fr)
- Analyse donnée Analyse n dimensionnelle Indexation Méthode arborescente Nombre Structure donnée
- Keyword (en)
- Data analysis Multidimensional analysis Indexing Tree structured method Number Data structure
- Keyword (es)
- Análisis datos Análisis n dimensional Indización Método arborescente Número Estructura datos
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B01 General
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B07 Memory organisation. Data processing / 001D02B07D Information systems. Data bases
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 15672717
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1007/978-3-540-45072-6_4 
https://dx.doi.org/10.1007/978-3-540-45072-6_4
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:27:\"10.1007\/978-3-540-45072-6_4\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:36:\"Bkd-tree: A dynamic scalable kd-tree\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2003\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"46\";s:8:\"\u0000*\u0000epage\";s:2:\"65\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"PROCOPIUC\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Octavian\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:17:\"AGARWAL, Pankaj K\";i:1;s:10:\"ARGE, Lars\";i:2;s:21:\"VITTER, Jeffrey Scott\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-40535-6\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:78:\"Advances in spatial and temporal databases (Santorini Island, 24-27 July 2003)\";s:8:\"\u0000*\u0000title\";s:36:\"Bkd-tree: A dynamic scalable kd-tree\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:27:\"10.1007\/978-3-540-45072-6_4\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:36:\"Bkd-tree: A dynamic scalable kd-tree\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2003\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"46\";s:8:\"\u0000*\u0000epage\";s:2:\"65\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"PROCOPIUC\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Octavian\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:17:\"AGARWAL, Pankaj K\";i:1;s:10:\"ARGE, Lars\";i:2;s:21:\"VITTER, Jeffrey Scott\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-40535-6\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:78:\"Advances in spatial and temporal databases (Santorini Island, 24-27 July 2003)\";s:8:\"\u0000*\u0000title\";s:36:\"Bkd-tree: A dynamic scalable kd-tree\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:27:\"10.1007\/978-3-540-45072-6_4\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:27:\"10.1007\/978-3-540-45072-6_4\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:36:\"Bkd-tree: A dynamic scalable kd-tree\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2003\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"46\";s:8:\"\u0000*\u0000epage\";s:2:\"65\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"PROCOPIUC\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Octavian\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:17:\"AGARWAL, Pankaj K\";i:1;s:10:\"ARGE, Lars\";i:2;s:21:\"VITTER, Jeffrey Scott\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-40535-6\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:78:\"Advances in spatial and temporal databases (Santorini Island, 24-27 July 2003)\";s:8:\"\u0000*\u0000title\";s:36:\"Bkd-tree: A dynamic scalable kd-tree\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:27:\"10.1007\/978-3-540-45072-6_4\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:36:\"Bkd-tree: A dynamic scalable kd-tree\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2003\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"46\";s:8:\"\u0000*\u0000epage\";s:2:\"65\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"PROCOPIUC\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Octavian\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:17:\"AGARWAL, Pankaj K\";i:1;s:10:\"ARGE, Lars\";i:2;s:21:\"VITTER, Jeffrey Scott\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-40535-6\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:78:\"Advances in spatial and temporal databases (Santorini Island, 24-27 July 2003)\";s:8:\"\u0000*\u0000title\";s:36:\"Bkd-tree: A dynamic scalable kd-tree\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"20\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
