| Document Date: 2003-03-31 10:28:50
Open Document File Size: 1,05 MBShare Result on Facebook
City Data Houston / / Company Bayer / L&t / / Currency USD / / IndustryTerm spatial search / quadratic algorithm / check search area / search performance / exhaustive algorithm / database systems / search algonthm / spht algorithms / lmear algorithm / range search / give algorithms / wnh search rectangles / geo-data applications / linear algorithm / search rectangle / search area / mtotwo groups / e -cdentijier / node-splitting algorithms / search space / e-lent / search algorithm / knear algorithm / spatial applications / / Organization National Science Foundation / ded / DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING Antomn Guttman University of Cahforma Berkeley Abstract In / / Person Max Entnes / / Position Prime Minister / wasteful pm / extreme pm / / Product PS2 / M-16 / / ProgrammingLanguage J / C / K / / ProvinceOrState Texas / / PublishedMedium Communications of the ACM / / Technology node-splitting algorithms / give algorithms / exhaustive algorithm / QuadratIc algorithm / two groups Algorithm / Linear algorithm / remammg entries Algorithm / Searching The search algorithm / relational database system / Exhaukve algorithm / Relational Database / entrees Algorithm / Deletion Algorithm / RISC-II computer chip / dnnenslons The algorithm / Lmear algorithm / tree Algorithm / Exhaustwe algorithm / Linear-Cost Algollthm Tlus algorithm / CAD / spht algorithms / /
SocialTag |
R-TREES. A DYNAMIC INDEX STRUCTURE FOR SPATIAL SEARCHING Antomn Guttman University of Cahforma Berkeley