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...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| 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 KANTH V RAVADA SIVA KUMAR 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>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US7219108B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US7219108B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US7219108B23</originalsourceid><addsrcrecordid>eNrjZDALLE0tqlQoKCrNy8vMS1coLQaRqRUlqUWZ-UUKJZk5qcUKmXkKiXkKQbolRampQE5KagUPA2taYk5xKi-U5mZQcHMNcfbQTS3Ij08tLkhMTs1LLYkPDTY3MrQ0NLBwMjImQgkAPP4tFA</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>esp@cenet</source><creator>GERINGER DANIEL ; KOTHURI RAVI KANTH V ; RAVADA SIVA KUMAR ; ABUGOV DANIEL</creator><creatorcontrib>GERINGER DANIEL ; KOTHURI RAVI KANTH V ; RAVADA SIVA KUMAR ; 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><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2007</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20070515&DB=EPODOC&CC=US&NR=7219108B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20070515&DB=EPODOC&CC=US&NR=7219108B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>GERINGER DANIEL</creatorcontrib><creatorcontrib>KOTHURI RAVI KANTH V</creatorcontrib><creatorcontrib>RAVADA SIVA KUMAR</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><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2007</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZDALLE0tqlQoKCrNy8vMS1coLQaRqRUlqUWZ-UUKJZk5qcUKmXkKiXkKQbolRampQE5KagUPA2taYk5xKi-U5mZQcHMNcfbQTS3Ij08tLkhMTs1LLYkPDTY3MrQ0NLBwMjImQgkAPP4tFA</recordid><startdate>20070515</startdate><enddate>20070515</enddate><creator>GERINGER DANIEL</creator><creator>KOTHURI RAVI KANTH V</creator><creator>RAVADA SIVA KUMAR</creator><creator>ABUGOV DANIEL</creator><scope>EVB</scope></search><sort><creationdate>20070515</creationdate><title>Query prunning using exterior tiles in an R-tree index</title><author>GERINGER DANIEL ; KOTHURI RAVI KANTH V ; RAVADA SIVA KUMAR ; ABUGOV DANIEL</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US7219108B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2007</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>GERINGER DANIEL</creatorcontrib><creatorcontrib>KOTHURI RAVI KANTH V</creatorcontrib><creatorcontrib>RAVADA SIVA KUMAR</creatorcontrib><creatorcontrib>ABUGOV DANIEL</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>GERINGER DANIEL</au><au>KOTHURI RAVI KANTH V</au><au>RAVADA SIVA KUMAR</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>2007-05-15</date><risdate>2007</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_epo_espacenet_US7219108B2 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| 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=2024-12-30T20%3A44%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=GERINGER%20DANIEL&rft.date=2007-05-15&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS7219108B2%3C/epo_EVB%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 |