A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases
Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (R...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ayanso, Anteneh [verfasserIn] Goes, Paulo B. [author] Mehta, Kumar [author] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2009 |
|---|
| Schlagwörter: |
|---|
| Umfang: |
Online-Ressource |
|---|
| Reproduktion: |
IGI Global InfoSci Journals Archive 2000 - 2012 |
|---|---|
| Übergeordnetes Werk: |
In: Journal of database management - Hershey, Pa : IGI Global, 2000, 20(2009), 4, Seite 1-25 |
| Übergeordnetes Werk: |
volume:20 ; year:2009 ; number:4 ; pages:1-25 |
| Links: |
|---|
| DOI / URN: |
10.4018/jdm.2009062501 |
|---|
| Katalog-ID: |
NLEJ244518653 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ244518653 | ||
| 003 | DE-627 | ||
| 005 | 20240202180313.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 150605s2009 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.4018/jdm.2009062501 |2 doi | |
| 035 | |a (DE-627)NLEJ244518653 | ||
| 035 | |a (VZGNL)10.4018/jdm.2009062501 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Ayanso, Anteneh |e verfasserin |4 aut | |
| 245 | 1 | 2 | |a A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases |
| 264 | 1 | |c 2009 | |
| 300 | |a Online-Ressource | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods | ||
| 533 | |f IGI Global InfoSci Journals Archive 2000 - 2012 | ||
| 650 | 4 | |a Relational Databases | |
| 650 | 4 | |a Top-K Query | |
| 650 | 4 | |a Query-Mapping | |
| 650 | 4 | |a Query Processing | |
| 650 | 4 | |a Cost Model | |
| 650 | 4 | |a Tradeoff Analysis | |
| 650 | 4 | |a Uncertainty Modeling | |
| 700 | 1 | |a Goes, Paulo B. |e author |4 aut | |
| 700 | 1 | |a Mehta, Kumar |e author |4 aut | |
| 773 | 0 | 8 | |i In |t Journal of database management |d Hershey, Pa : IGI Global, 2000 |g 20(2009), 4, Seite 1-25 |h Online-Ressource |w (DE-627)NLEJ24441971X |w (DE-600)2070075-1 |x 1533-8010 |7 nnns |
| 773 | 1 | 8 | |g volume:20 |g year:2009 |g number:4 |g pages:1-25 |
| 856 | 4 | 0 | |u http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501 |m X:IGIG |x Verlag |z Deutschlandweit zugänglich |
| 856 | 4 | 2 | |u http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501&buylink=true |q text/html |y Abstract |z Deutschlandweit zugänglich |
| 912 | |a ZDB-1-GIS | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 20 |j 2009 |e 4 |h 1-25 | ||
| author_variant |
a a aa p b g pb pbg k m km |
|---|---|
| matchkey_str |
article:15338010:2009----::csbsdagetmtofrapntpslcinureo |
| hierarchy_sort_str |
2009 |
| publishDate |
2009 |
| allfields |
10.4018/jdm.2009062501 doi (DE-627)NLEJ244518653 (VZGNL)10.4018/jdm.2009062501 DE-627 ger DE-627 rakwb eng Ayanso, Anteneh verfasserin aut A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases 2009 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods IGI Global InfoSci Journals Archive 2000 - 2012 Relational Databases Top-K Query Query-Mapping Query Processing Cost Model Tradeoff Analysis Uncertainty Modeling Goes, Paulo B. author aut Mehta, Kumar author aut In Journal of database management Hershey, Pa : IGI Global, 2000 20(2009), 4, Seite 1-25 Online-Ressource (DE-627)NLEJ24441971X (DE-600)2070075-1 1533-8010 nnns volume:20 year:2009 number:4 pages:1-25 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 20 2009 4 1-25 |
| spelling |
10.4018/jdm.2009062501 doi (DE-627)NLEJ244518653 (VZGNL)10.4018/jdm.2009062501 DE-627 ger DE-627 rakwb eng Ayanso, Anteneh verfasserin aut A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases 2009 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods IGI Global InfoSci Journals Archive 2000 - 2012 Relational Databases Top-K Query Query-Mapping Query Processing Cost Model Tradeoff Analysis Uncertainty Modeling Goes, Paulo B. author aut Mehta, Kumar author aut In Journal of database management Hershey, Pa : IGI Global, 2000 20(2009), 4, Seite 1-25 Online-Ressource (DE-627)NLEJ24441971X (DE-600)2070075-1 1533-8010 nnns volume:20 year:2009 number:4 pages:1-25 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 20 2009 4 1-25 |
| allfields_unstemmed |
10.4018/jdm.2009062501 doi (DE-627)NLEJ244518653 (VZGNL)10.4018/jdm.2009062501 DE-627 ger DE-627 rakwb eng Ayanso, Anteneh verfasserin aut A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases 2009 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods IGI Global InfoSci Journals Archive 2000 - 2012 Relational Databases Top-K Query Query-Mapping Query Processing Cost Model Tradeoff Analysis Uncertainty Modeling Goes, Paulo B. author aut Mehta, Kumar author aut In Journal of database management Hershey, Pa : IGI Global, 2000 20(2009), 4, Seite 1-25 Online-Ressource (DE-627)NLEJ24441971X (DE-600)2070075-1 1533-8010 nnns volume:20 year:2009 number:4 pages:1-25 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 20 2009 4 1-25 |
| allfieldsGer |
10.4018/jdm.2009062501 doi (DE-627)NLEJ244518653 (VZGNL)10.4018/jdm.2009062501 DE-627 ger DE-627 rakwb eng Ayanso, Anteneh verfasserin aut A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases 2009 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods IGI Global InfoSci Journals Archive 2000 - 2012 Relational Databases Top-K Query Query-Mapping Query Processing Cost Model Tradeoff Analysis Uncertainty Modeling Goes, Paulo B. author aut Mehta, Kumar author aut In Journal of database management Hershey, Pa : IGI Global, 2000 20(2009), 4, Seite 1-25 Online-Ressource (DE-627)NLEJ24441971X (DE-600)2070075-1 1533-8010 nnns volume:20 year:2009 number:4 pages:1-25 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 20 2009 4 1-25 |
| allfieldsSound |
10.4018/jdm.2009062501 doi (DE-627)NLEJ244518653 (VZGNL)10.4018/jdm.2009062501 DE-627 ger DE-627 rakwb eng Ayanso, Anteneh verfasserin aut A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases 2009 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods IGI Global InfoSci Journals Archive 2000 - 2012 Relational Databases Top-K Query Query-Mapping Query Processing Cost Model Tradeoff Analysis Uncertainty Modeling Goes, Paulo B. author aut Mehta, Kumar author aut In Journal of database management Hershey, Pa : IGI Global, 2000 20(2009), 4, Seite 1-25 Online-Ressource (DE-627)NLEJ24441971X (DE-600)2070075-1 1533-8010 nnns volume:20 year:2009 number:4 pages:1-25 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 20 2009 4 1-25 |
| language |
English |
| source |
In Journal of database management 20(2009), 4, Seite 1-25 volume:20 year:2009 number:4 pages:1-25 |
| sourceStr |
In Journal of database management 20(2009), 4, Seite 1-25 volume:20 year:2009 number:4 pages:1-25 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Relational Databases Top-K Query Query-Mapping Query Processing Cost Model Tradeoff Analysis Uncertainty Modeling |
| isfreeaccess_bool |
false |
| container_title |
Journal of database management |
| authorswithroles_txt_mv |
Ayanso, Anteneh @@aut@@ Goes, Paulo B. @@aut@@ Mehta, Kumar @@aut@@ |
| publishDateDaySort_date |
2009-01-01T00:00:00Z |
| hierarchy_top_id |
NLEJ24441971X |
| id |
NLEJ244518653 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ244518653</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240202180313.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">150605s2009 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4018/jdm.2009062501</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ244518653</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(VZGNL)10.4018/jdm.2009062501</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ayanso, Anteneh</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">IGI Global InfoSci Journals Archive 2000 - 2012</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Relational Databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Top-K Query</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Query-Mapping</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Query Processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cost Model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tradeoff Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Uncertainty Modeling</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goes, Paulo B.</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mehta, Kumar</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of database management</subfield><subfield code="d">Hershey, Pa : IGI Global, 2000</subfield><subfield code="g">20(2009), 4, Seite 1-25</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ24441971X</subfield><subfield code="w">(DE-600)2070075-1</subfield><subfield code="x">1533-8010</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:20</subfield><subfield code="g">year:2009</subfield><subfield code="g">number:4</subfield><subfield code="g">pages:1-25</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501</subfield><subfield code="m">X:IGIG</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501&buylink=true</subfield><subfield code="q">text/html</subfield><subfield code="y">Abstract</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-GIS</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">20</subfield><subfield code="j">2009</subfield><subfield code="e">4</subfield><subfield code="h">1-25</subfield></datafield></record></collection>
|
| series2 |
IGI Global InfoSci Journals Archive 2000 - 2012 |
| author |
Ayanso, Anteneh |
| spellingShingle |
Ayanso, Anteneh misc Relational Databases misc Top-K Query misc Query-Mapping misc Query Processing misc Cost Model misc Tradeoff Analysis misc Uncertainty Modeling A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases |
| authorStr |
Ayanso, Anteneh |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ24441971X |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
NL |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1533-8010 |
| topic_title |
A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases Relational Databases Top-K Query Query-Mapping Query Processing Cost Model Tradeoff Analysis Uncertainty Modeling |
| topic |
misc Relational Databases misc Top-K Query misc Query-Mapping misc Query Processing misc Cost Model misc Tradeoff Analysis misc Uncertainty Modeling |
| topic_unstemmed |
misc Relational Databases misc Top-K Query misc Query-Mapping misc Query Processing misc Cost Model misc Tradeoff Analysis misc Uncertainty Modeling |
| topic_browse |
misc Relational Databases misc Top-K Query misc Query-Mapping misc Query Processing misc Cost Model misc Tradeoff Analysis misc Uncertainty Modeling |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| hierarchy_parent_title |
Journal of database management |
| hierarchy_parent_id |
NLEJ24441971X |
| hierarchy_top_title |
Journal of database management |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ24441971X (DE-600)2070075-1 |
| title |
A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases |
| ctrlnum |
(DE-627)NLEJ244518653 (VZGNL)10.4018/jdm.2009062501 |
| title_full |
A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases |
| author_sort |
Ayanso, Anteneh |
| journal |
Journal of database management |
| journalStr |
Journal of database management |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2009 |
| contenttype_str_mv |
zzz |
| container_start_page |
1 |
| author_browse |
Ayanso, Anteneh Goes, Paulo B. Mehta, Kumar |
| container_volume |
20 |
| physical |
Online-Ressource |
| format_se |
Elektronische Aufsätze |
| author-letter |
Ayanso, Anteneh |
| doi_str_mv |
10.4018/jdm.2009062501 |
| author2-role |
author |
| title_sort |
cost-based range estimation for mapping top-k selection queries over relational databases |
| title_auth |
A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases |
| abstract |
Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods |
| abstractGer |
Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods |
| abstract_unstemmed |
Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods |
| collection_details |
ZDB-1-GIS GBV_NL_ARTICLE |
| container_issue |
4 |
| title_short |
A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases |
| url |
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501&buylink=true |
| remote_bool |
true |
| author2 |
Goes, Paulo B. Mehta, Kumar |
| author2Str |
Goes, Paulo B. Mehta, Kumar |
| ppnlink |
NLEJ24441971X |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.4018/jdm.2009062501 |
| up_date |
2024-07-06T08:09:48.389Z |
| _version_ |
1803816416985481216 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ244518653</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240202180313.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">150605s2009 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4018/jdm.2009062501</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ244518653</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(VZGNL)10.4018/jdm.2009062501</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ayanso, Anteneh</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Cost-Based Range Estimation for Mapping Top-k Selection Queries over Relational Databases</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Finding efficient methods for supporting top-k relational queries has received significant attention in academic research. One of the approaches in the recent literature is query-mapping, in which top-k queries are mapped (translated) into equivalent range queries that relational database systems (RDBMSs) normally support. This approach combines the advantage of simplicity as well as practicality by avoiding the need for modifications to the query engine, or specialized data structures or indexing techniques to handle top-k queries separately. However, existing methods following this approach fall short of adequately modeling the problem environment and providing consistent results. In this article, the authors propose a cost-based range estimation model for the query-mapping approach. They provide a methodology for trading-off relevant query execution cost components and mapping a top-k query into a cost-optimal range query for efficient execution. Their experiments on real world and synthetic data sets show that the proposed strategy not only avoids the need to calibrate workloads on specific database contents, but also performs at least as well as prior methods</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">IGI Global InfoSci Journals Archive 2000 - 2012</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Relational Databases</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Top-K Query</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Query-Mapping</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Query Processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cost Model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Tradeoff Analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Uncertainty Modeling</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goes, Paulo B.</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Mehta, Kumar</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of database management</subfield><subfield code="d">Hershey, Pa : IGI Global, 2000</subfield><subfield code="g">20(2009), 4, Seite 1-25</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ24441971X</subfield><subfield code="w">(DE-600)2070075-1</subfield><subfield code="x">1533-8010</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:20</subfield><subfield code="g">year:2009</subfield><subfield code="g">number:4</subfield><subfield code="g">pages:1-25</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501</subfield><subfield code="m">X:IGIG</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2009062501&buylink=true</subfield><subfield code="q">text/html</subfield><subfield code="y">Abstract</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-GIS</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">20</subfield><subfield code="j">2009</subfield><subfield code="e">4</subfield><subfield code="h">1-25</subfield></datafield></record></collection>
|
| score |
7.3993025 |