Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitemtc-m16c.sid.inpe.br
Holder Codeisadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S
Identifier83LX3pFwXQZ3V9uMbiY/MhUjo
Repositorydpi.inpe.br/geoinfo@80/2006/08.28.19.35
Last Update2014:09.17.11.37.43 (UTC) simone
Metadata Repositorydpi.inpe.br/geoinfo@80/2006/08.28.19.36.01
Metadata Last Update2023:01.30.13.12.39 (UTC) administrator
ISBN85-17-00026-9
978-85-17-00026-3
Citation KeyKriegelKunaPfeiRenz:2003:EfQuPr
TitleEfficient query processing on the relational quadtree
FormatCD-ROM; On-line.
Year2003
Access Date2024, Mar. 28
Secondary TypePRE CN
Number of Files1
Size843 KiB
2. Context
Author1 Kriegel, Hans-Peter
2 Kunath, Peter
3 Pfeifle, Martin
4 Renz, Matthias
Affiliation1 University of Munich
2 University of Munich
3 University of Munich
4 University of Munich
Author e-Mail Address1 kriegel@dbs.informatik.uni-muenchen.de
2 kunath@dbs.informatik.uni-muenchen.de
3 pfeifle@dbs.informatik.uni-muenchen.de
4 renz@dbs.informatik.uni-muenchen.de
EditorCasanova, Marco Antônio
Câmara Neto, Gilberto
e-Mail Addressgeoinfo@dpi.inpe.br
Conference NameSimpósio Brasileiro de Geoinformática, 5 (GEOINFO).
Conference LocationCampos do Jordão
Date3-5 nov. 2003
PublisherInstituto Nacional de Pesquisas Espaciais (INPE)
Publisher CitySão José dos Campos
Book TitleAnais
History (UTC)2006-08-28 19:36:01 :: isaiasjr -> administrator ::
2008-01-10 21:01:37 :: administrator -> isaiasjr ::
2008-07-18 16:12:04 :: isaiasjr -> administrator ::
2014-09-16 16:21:40 :: administrator -> geoinfo@dpi.inpe.br :: 2003
2014-09-17 11:37:43 :: geoinfo@dpi.inpe.br -> administrator :: 2003
2020-05-18 17:31:12 :: administrator -> simone :: 2003
2020-05-18 17:43:04 :: simone -> administrator :: 2003
2023-01-30 13:12:39 :: administrator -> :: 2003
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
AbstractRelational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing object-relational database systems. Furthermore, there exist effective and efficient models to estimate the selectivity and the I/O cost in order to guide the cost-based optimizer whether and how to include these index structures into the execution plan. By design, the models immediately fit to common extensible indexing/optimization frameworks, and their implementations exploit the built-in statistics facilities of the database server. In this paper, we show how these statistics can also be used for accelerating geo-spatial queries using the relational quadtree by reducing the number of generated join partners which results in less logical reads and consequently improves the overall runtime. We cut down on the number of join partners by grouping different join partners together according to a statistic driven grouping algorithm. Our experiments on an Oracle9i database yield an average speed-up between 30% and 300% for spatial selection queries on the Relational Quadtree.
AreaSRE
Arrangement 1urlib.net > BDMCI > Fonds > GEOINFO > V GEOINFO > Efficient query processing...
Arrangement 2urlib.net > BDMCI > Fonds > Produção anterior à 2021 > DIDPI > V GEOINFO > Efficient query processing...
Arrangement 3urlib.net > BDMCI > Fonds > GEOINFO > Coleção GEOINFO > Efficient query processing...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/83LX3pFwXQZ3V9uMbiY/MhUjo
zipped data URLhttp://urlib.net/zip/83LX3pFwXQZ3V9uMbiY/MhUjo
Languageen
Target FileEfficient Query Processing on the Relational Quadtree.pdf
User Groupadministrator
geoinfo@dpi.inpe.br
isaiasjr
Reader Groupadministrator
geoinfo@dpi.inpe.br
simone
Visibilityshown
Update Permissionnot transferred
5. Allied materials
Mirror Repositorysid.inpe.br/mtc-m18@80/2008/03.17.15.17.24
Next Higher Units8JMKD3MGP8W/3H5FH2B
8JMKD3MGPDW34P/48F29JE
Host Collectionsid.inpe.br/mtc-m18@80/2008/03.17.15.17
6. Notes
Empty Fieldsarchivingpolicy archivist callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination doi edition group issn keywords label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark serieseditor session shorttitle sponsor subject tertiarymark tertiarytype type url versiontype volume


Close