Query prunning using exterior tiles in an R-tree index

Query prunning using exterior tiles in an R-tree index

Determining relationships among objects represented in a database includes defining a plurality of tiles in the approximation of the first geometry by dividing the approximation of the first geometry in a first direction a plurality of times and dividing the approximation of the first geometry in a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Geringer, Daniel, Kothuri, Ravi, Ravada, Siva, Abugov, Daniel
Format: Patent
Sprache:eng
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Geringer, Daniel
Kothuri, Ravi
Ravada, Siva
Abugov, Daniel
description Determining relationships among objects represented in a database includes defining a plurality of tiles in the approximation of the first geometry by dividing the approximation of the first geometry in a first direction a plurality of times and dividing the approximation of the first geometry in a second direction perpendicular to the first direction a plurality of times. A second geometry is analyzed to determine if it fulfills a first filter condition with respect to any of the tiles defined in the approximation of the first geometry. If the second geometry fulfills the first filter condition with respect to any of the tiles defined in the first geometry carrying out a mathematical comparison of the first geometry and the second geometry.
format Patent
fullrecord <record><control><sourceid>uspatents_EFI</sourceid><recordid>TN_cdi_uspatents_applications_20040215641</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>20040215641</sourcerecordid><originalsourceid>FETCH-uspatents_applications_200402156413</originalsourceid><addsrcrecordid>eNrjZDALLE0tqlQoKCrNy8vMS1coLQaRqRUlqUWZ-UUKJZk5qcUKmXkKiXkKQbolRampQE5KagUPA2taYk5xKi-U5mbQdHMNcfbQLS0uSCxJzSspjk8sKMjJTE4syczPK443MjAwMTAyNDUzMTQmRS0AAX00TA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Query prunning using exterior tiles in an R-tree index</title><source>USPTO Published Applications</source><creator>Geringer, Daniel ; Kothuri, Ravi ; Ravada, Siva ; Abugov, Daniel</creator><creatorcontrib>Geringer, Daniel ; Kothuri, Ravi ; Ravada, Siva ; Abugov, Daniel</creatorcontrib><description>Determining relationships among objects represented in a database includes defining a plurality of tiles in the approximation of the first geometry by dividing the approximation of the first geometry in a first direction a plurality of times and dividing the approximation of the first geometry in a second direction perpendicular to the first direction a plurality of times. A second geometry is analyzed to determine if it fulfills a first filter condition with respect to any of the tiles defined in the approximation of the first geometry. If the second geometry fulfills the first filter condition with respect to any of the tiles defined in the first geometry carrying out a mathematical comparison of the first geometry and the second geometry.</description><language>eng</language><creationdate>2004</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://image-ppubs.uspto.gov/dirsearch-public/print/downloadPdf/20040215641$$EPDF$$P50$$Guspatents$$Hfree_for_read</linktopdf><link.rule.ids>230,308,778,871,883,64040</link.rule.ids><linktorsrc>$$Uhttps://patentcenter.uspto.gov/applications/10841540$$EView_record_in_USPTO$$FView_record_in_$$GUSPTO$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>Geringer, Daniel</creatorcontrib><creatorcontrib>Kothuri, Ravi</creatorcontrib><creatorcontrib>Ravada, Siva</creatorcontrib><creatorcontrib>Abugov, Daniel</creatorcontrib><title>Query prunning using exterior tiles in an R-tree index</title><description>Determining relationships among objects represented in a database includes defining a plurality of tiles in the approximation of the first geometry by dividing the approximation of the first geometry in a first direction a plurality of times and dividing the approximation of the first geometry in a second direction perpendicular to the first direction a plurality of times. A second geometry is analyzed to determine if it fulfills a first filter condition with respect to any of the tiles defined in the approximation of the first geometry. If the second geometry fulfills the first filter condition with respect to any of the tiles defined in the first geometry carrying out a mathematical comparison of the first geometry and the second geometry.</description><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2004</creationdate><recordtype>patent</recordtype><sourceid>EFI</sourceid><recordid>eNrjZDALLE0tqlQoKCrNy8vMS1coLQaRqRUlqUWZ-UUKJZk5qcUKmXkKiXkKQbolRampQE5KagUPA2taYk5xKi-U5mbQdHMNcfbQLS0uSCxJzSspjk8sKMjJTE4syczPK443MjAwMTAyNDUzMTQmRS0AAX00TA</recordid><startdate>20041028</startdate><enddate>20041028</enddate><creator>Geringer, Daniel</creator><creator>Kothuri, Ravi</creator><creator>Ravada, Siva</creator><creator>Abugov, Daniel</creator><scope>EFI</scope></search><sort><creationdate>20041028</creationdate><title>Query prunning using exterior tiles in an R-tree index</title><author>Geringer, Daniel ; Kothuri, Ravi ; Ravada, Siva ; Abugov, Daniel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-uspatents_applications_200402156413</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2004</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Geringer, Daniel</creatorcontrib><creatorcontrib>Kothuri, Ravi</creatorcontrib><creatorcontrib>Ravada, Siva</creatorcontrib><creatorcontrib>Abugov, Daniel</creatorcontrib><collection>USPTO Published Applications</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Geringer, Daniel</au><au>Kothuri, Ravi</au><au>Ravada, Siva</au><au>Abugov, Daniel</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Query prunning using exterior tiles in an R-tree index</title><date>2004-10-28</date><risdate>2004</risdate><abstract>Determining relationships among objects represented in a database includes defining a plurality of tiles in the approximation of the first geometry by dividing the approximation of the first geometry in a first direction a plurality of times and dividing the approximation of the first geometry in a second direction perpendicular to the first direction a plurality of times. A second geometry is analyzed to determine if it fulfills a first filter condition with respect to any of the tiles defined in the approximation of the first geometry. If the second geometry fulfills the first filter condition with respect to any of the tiles defined in the first geometry carrying out a mathematical comparison of the first geometry and the second geometry.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_uspatents_applications_20040215641
source USPTO Published Applications
title Query prunning using exterior tiles in an R-tree index
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T22%3A27%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-uspatents_EFI&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=Geringer,%20Daniel&rft.date=2004-10-28&rft_id=info:doi/&rft_dat=%3Cuspatents_EFI%3E20040215641%3C/uspatents_EFI%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true