A Buffer Model for Evaluating Scott T. R-tree Performance Mario A. Lopez Leutenegger and Computer of Denver {leut,mlopez}Qcs. Mathematics University Science Denver, CO Department 80208-0189 du.edu R-trees Introduction [3] are data a common indexing technique boxes for multigeand are widely such as points, query region. performance of various accessed used in spatial polygons, Several and scientific complex inbeen cific algorithm Then, input to create actual R-trees for various data sets. we compute to our buffer the MBRa model. of tree nodes and use these as dimensional databaaes. ometric objects, tersect proposed By storing the bounding of arbitrary or more which objects have objects, R-trees a given Buffer Model Description notation: can be used to determine In deriving our model we use the following being modeled variants to improve [1, 5, 9]. R-tree algorithms, have metric. in main perforbe To this the numgiven the nodes the splitshould T = Specific M, = Number R-Tree of nodes at the ith level of T Performance used the number In real databases memory. mance, studies of nodes as the primary affect a query. M = Total R,, A,j = jth number of nodes in T, i.e., ~& level of T (point kfi
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/a-buffer-model-for-evaluating-r-tree-performance-kqCZmzmaU4
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
A buffer model for evaluating R-tree performance
Leutenegger, Scott T.; Lopez, Mario A.
Follow ACM SIGMETRICS Performance Evaluation Review
, Volume 24 (1)
Association for Computing Machinery – May 15, 1996
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
