{"id":"https://openalex.org/W1983643655","doi":"https://doi.org/10.1109/icme.2001.1237942","title":"Clustered SS-tree","display_name":"Clustered SS-tree","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1983643655","doi":"https://doi.org/10.1109/icme.2001.1237942","mag":"1983643655"},"language":"en","primary_location":{"id":"doi:10.1109/icme.2001.1237942","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icme.2001.1237942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036407287","display_name":"S. Praminik","orcid":null},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Praminik","raw_affiliation_strings":["Michigan State University"],"affiliations":[{"raw_affiliation_string":"Michigan State University","institution_ids":["https://openalex.org/I87216513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100319323","display_name":"Jinhua Li","orcid":"https://orcid.org/0000-0001-7126-9689"},"institutions":[{"id":"https://openalex.org/I87216513","display_name":"Michigan State University","ror":"https://ror.org/05hs6h993","country_code":"US","type":"education","lineage":["https://openalex.org/I87216513"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jinhua Li","raw_affiliation_strings":["Department of Computer Science, Michigan State University, East Lansing, MI, USA","Dept. of Computer Science Michigan State University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Michigan State University, East Lansing, MI, USA","institution_ids":["https://openalex.org/I87216513"]},{"raw_affiliation_string":"Dept. of Computer Science Michigan State University","institution_ids":["https://openalex.org/I87216513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036407287"],"corresponding_institution_ids":["https://openalex.org/I87216513"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11494775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1195","last_page":"1198"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.8446497917175293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6773741841316223},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6643474102020264},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6236634254455566},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5730580687522888},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5682222843170166},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.5408307909965515},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.5279300212860107},{"id":"https://openalex.org/keywords/b-tree","display_name":"B-tree","score":0.5023365020751953},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.494594544172287},{"id":"https://openalex.org/keywords/database-index","display_name":"Database index","score":0.4868735373020172},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.48334285616874695},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.4780053198337555},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4762937128543854},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.4592241644859314},{"id":"https://openalex.org/keywords/r-tree","display_name":"R-tree","score":0.45428773760795593},{"id":"https://openalex.org/keywords/best-bin-first","display_name":"Best bin first","score":0.43718934059143066},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.43534770607948303},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4272615909576416},{"id":"https://openalex.org/keywords/access-method","display_name":"Access method","score":0.419768750667572},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3252885937690735},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.23429781198501587},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.233708918094635},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.22400987148284912},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.196064293384552},{"id":"https://openalex.org/keywords/spatial-database","display_name":"Spatial database","score":0.1882457137107849},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13651210069656372},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.12498071789741516},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.12441295385360718},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07008108496665955},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.06171303987503052},{"id":"https://openalex.org/keywords/spatial-analysis","display_name":"Spatial analysis","score":0.05635565519332886}],"concepts":[{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.8446497917175293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6773741841316223},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6643474102020264},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6236634254455566},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5730580687522888},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5682222843170166},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.5408307909965515},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.5279300212860107},{"id":"https://openalex.org/C78669399","wikidata":"https://www.wikidata.org/wiki/Q677051","display_name":"B-tree","level":3,"score":0.5023365020751953},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.494594544172287},{"id":"https://openalex.org/C59276292","wikidata":"https://www.wikidata.org/wiki/Q580427","display_name":"Database index","level":3,"score":0.4868735373020172},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.48334285616874695},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.4780053198337555},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4762937128543854},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.4592241644859314},{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.45428773760795593},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.43718934059143066},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.43534770607948303},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4272615909576416},{"id":"https://openalex.org/C70000936","wikidata":"https://www.wikidata.org/wiki/Q4672467","display_name":"Access method","level":2,"score":0.419768750667572},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3252885937690735},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.23429781198501587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.233708918094635},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.22400987148284912},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.196064293384552},{"id":"https://openalex.org/C203689450","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial database","level":3,"score":0.1882457137107849},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13651210069656372},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.12498071789741516},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.12441295385360718},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07008108496665955},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.06171303987503052},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.05635565519332886},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icme.2001.1237942","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icme.2001.1237942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE International Conference on Multimedia and Expo, 2001. ICME 2001.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1541459201","https://openalex.org/W1672197616","https://openalex.org/W1996510517","https://openalex.org/W2008297189","https://openalex.org/W2070572105","https://openalex.org/W2097625548","https://openalex.org/W2106822074","https://openalex.org/W2134414115","https://openalex.org/W2138313032","https://openalex.org/W2144679084","https://openalex.org/W2155776210","https://openalex.org/W6632397832","https://openalex.org/W6636955212"],"related_works":["https://openalex.org/W2111025582","https://openalex.org/W2008192856","https://openalex.org/W2168358369","https://openalex.org/W131606651","https://openalex.org/W2111273995","https://openalex.org/W1555625619","https://openalex.org/W49817070","https://openalex.org/W2155713641","https://openalex.org/W2125939294","https://openalex.org/W2555447445"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"efficient":[3,47],"indexing":[4],"method":[5],"called":[6],"clustered":[7,50],"SS-tree":[8,51,65],"for":[9,13,46,49],"high":[10,44],"dimensional":[11],"database":[12],"approximate":[14],"nearest":[15,61],"neighbor":[16,62],"queries.":[17],"The":[18],"main":[19],"idea":[20],"of":[21,36,55,64],"this":[22],"approach":[23],"is":[24],"to":[25],"cluster":[26],"data":[27],"before":[28],"creating":[29],"the":[30],"index":[31,37],"and":[32,66],"then":[33],"apply":[34],"filtering":[35],"nodes":[38],"based":[39],"on":[40],"angle":[41],"property":[42],"in":[43],"dimension":[45],"searching":[48],"provides":[52],"several":[53],"orders":[54],"magnitude":[56],"better":[57],"performance":[58],"than":[59],"exact":[60],"search":[63],"VA":[67],"file.":[68]},"counts_by_year":[],"updated_date":"2026-03-17T06:59:57.516163","created_date":"2016-06-24T00:00:00"}