Back to Results
First PageMeta Content
R-tree / Search algorithms / Data structures / Data mining / Information retrieval / Nearest neighbor search / Dimension / Array data structure / Database index / Information science / Mathematics / Information


Indexing the Edges – A simple and yet efficient approach to high-dimensional indexing Beng Chin Ooi Kian-Lee Tan
Add to Reading List

Document Date: 2010-04-05 21:38:03


Open Document

File Size: 212,52 KB

Share Result on Facebook

City

Boston / Dallas / /

Company

Advanced Database Systems / /

Country

United States / /

Currency

USD / /

/

Facility

National University of Singapore / Pyramid Technique / Pyramid As / Pyramid iMinMax Seq-Scan / Pyramid iMinMax / Computer Science National University of Singapore / /

IndustryTerm

search condition / multi-dimensional range search / search region / search algorithm rst maps / point search / search space / search algorithm / tree algorithms / nearest neighbor search / obvious solution / ective range query processing / search algorithms / /

Organization

Beng Chin Ooi Kian-Lee Tan Cui Yu Stephane Bressan Department / National University of Singapore / /

Person

Beng Chin Ooi Kian-Lee / /

Position

representative / candidate for further performance study / /

Technology

Range search algorithm / tree algorithms / 170 Algorithm / search algorithms / Point search algorithm / 4.1 Range Search Algorithm / /

SocialTag