| Document Date: 2012-05-22 05:07:04
Open Document File Size: 1,09 MBShare Result on Facebook
City Santa Barbara / Reading / / Company Addison-Wesley Pub1 Co / / Country West Germany / / Currency USD / / IndustryTerm spatial search / followmg algorithm / geographic and envrronmental database systems / quadratic algorithm / split-algorithms / database systems / linear split algorithm / insertion algorithm / deletion algorithm / pack algorithm / quadratic split algorithm / search path 1srequued / split algorithm / e-1ree / / OperatingSystem UNIX / / Organization Eldgen6sslsche Technlsche Hochschule / NHS / German Research Society / / Person Norbert Beckmann / Bernhard Seeger Praktuche Informatlk / Hans-Peterbegel Ralf Schneider / / Position rt / overlappmg drrectory rectangles Thus rt / / Product PS2 / / ProgrammingLanguage J / Modula-2 / R / C / K / / ProvinceOrState Massachusetts / / Technology appropriate manner Algorithm / pack algorithm / quadratic algorithm / 325 Algorithm / mto two groups s3 Algorithm / split algorithm / followmg algorithm Algorithm / UNIX / deletion algorithm / data rectangle The insertion algorithm / ChooseSubtree algorithm / else mvoke Split end Algorithm / high The algorithm / The algorithm / insertion algorithm Algorithm / linear split algorithm / followmg algorithm / 841 Algorithm / quadratic split algorithm / 4.1 Algorithm / normalized separation Algorithm / /
SocialTag |
The R*-tree: An Efficient and Robust AccessMethod for Points and Rectangles+ Norbert Beckmann, Hans-Peterbegel Ralf Schneider,Bernhard Seeger Praktuche Informatlk, Umversltaet Bremen, D-2800 Bremen 33, West Germany