On the semantics and evaluation of top-k queries in probabilistic databases

We formulate three intuitive semantic properties for top-k queries in probabilistic databases, and propose Global-Topk query semantics which satisfies all of them. We provide a dynamic programming algorithm to evaluate top-k queries under Global-Topk in simple probabilistic relations. For general pr...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Xi Zhang, Chomicki, J.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Bioinformatics Biometrics Biosensors Cleaning Computer science Face recognition Intelligent sensors Query processing Relational databases Statistics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	563
container_issue
container_start_page	556
container_title
container_volume
creator	Xi Zhang Chomicki, J.
description	We formulate three intuitive semantic properties for top-k queries in probabilistic databases, and propose Global-Topk query semantics which satisfies all of them. We provide a dynamic programming algorithm to evaluate top-k queries under Global-Topk in simple probabilistic relations. For general probabilistic relations, we show a polynomial reduction to the simple case. Our analysis shows that the complexity of query evaluation is linear in k and at most quadratic in database size.
doi_str_mv	10.1109/ICDEW.2008.4498380
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4498380</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4498380</ieee_id><sourcerecordid>4498380</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1340-b6bdf1afcaa302fe51d199c57741a245ebb32fa81ea715d3a43400c4ecb7996f3</originalsourceid><addsrcrecordid>eNpFkM1OwzAQhI1QJWjpC8DFL5DgtTc_PqJQSkWlXkAcq3WyFoY0KXGKxNtTRCXmMhppvjmMENegUgBlb1fV_eI11UqVKaItTanOxBRQI2rINZ7_B8gnYvpbtEpZay7EPMZ3dRRmxli8FE-bTo5vLCPvqBtDHSV1jeQvag80hr6TvZdjv08-5OeBh8BRhk7uh96RC22IR0I2NJKjyPFKTDy1kecnn4mXh8Vz9ZisN8tVdbdOAhhUictd44F8TWSU9pxBA9bWWVEgkMaMnTPaUwlMBWSNITxSqkauXWFt7s1M3PztBmbe7oewo-F7e3rC_ACaA1B1</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On the semantics and evaluation of top-k queries in probabilistic databases</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Xi Zhang ; Chomicki, J.</creator><creatorcontrib>Xi Zhang ; Chomicki, J.</creatorcontrib><description>We formulate three intuitive semantic properties for top-k queries in probabilistic databases, and propose Global-Topk query semantics which satisfies all of them. We provide a dynamic programming algorithm to evaluate top-k queries under Global-Topk in simple probabilistic relations. For general probabilistic relations, we show a polynomial reduction to the simple case. Our analysis shows that the complexity of query evaluation is linear in k and at most quadratic in database size.</description><identifier>ISBN: 1424421616</identifier><identifier>ISBN: 9781424421619</identifier><identifier>EISBN: 1424421624</identifier><identifier>EISBN: 9781424421626</identifier><identifier>DOI: 10.1109/ICDEW.2008.4498380</identifier><identifier>LCCN: 2008900993</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bioinformatics ; Biometrics ; Biosensors ; Cleaning ; Computer science ; Face recognition ; Intelligent sensors ; Query processing ; Relational databases ; Statistics</subject><ispartof>2008 IEEE 24th International Conference on Data Engineering Workshop, 2008, p.556-563</ispartof><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://ieeexplore.ieee.org/document/4498380$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27904,54898</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4498380$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Xi Zhang</creatorcontrib><creatorcontrib>Chomicki, J.</creatorcontrib><title>On the semantics and evaluation of top-k queries in probabilistic databases</title><title>2008 IEEE 24th International Conference on Data Engineering Workshop</title><addtitle>ICDEW</addtitle><description>We formulate three intuitive semantic properties for top-k queries in probabilistic databases, and propose Global-Topk query semantics which satisfies all of them. We provide a dynamic programming algorithm to evaluate top-k queries under Global-Topk in simple probabilistic relations. For general probabilistic relations, we show a polynomial reduction to the simple case. Our analysis shows that the complexity of query evaluation is linear in k and at most quadratic in database size.</description><subject>Bioinformatics</subject><subject>Biometrics</subject><subject>Biosensors</subject><subject>Cleaning</subject><subject>Computer science</subject><subject>Face recognition</subject><subject>Intelligent sensors</subject><subject>Query processing</subject><subject>Relational databases</subject><subject>Statistics</subject><isbn>1424421616</isbn><isbn>9781424421619</isbn><isbn>1424421624</isbn><isbn>9781424421626</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpFkM1OwzAQhI1QJWjpC8DFL5DgtTc_PqJQSkWlXkAcq3WyFoY0KXGKxNtTRCXmMhppvjmMENegUgBlb1fV_eI11UqVKaItTanOxBRQI2rINZ7_B8gnYvpbtEpZay7EPMZ3dRRmxli8FE-bTo5vLCPvqBtDHSV1jeQvag80hr6TvZdjv08-5OeBh8BRhk7uh96RC22IR0I2NJKjyPFKTDy1kecnn4mXh8Vz9ZisN8tVdbdOAhhUictd44F8TWSU9pxBA9bWWVEgkMaMnTPaUwlMBWSNITxSqkauXWFt7s1M3PztBmbe7oewo-F7e3rC_ACaA1B1</recordid><startdate>200804</startdate><enddate>200804</enddate><creator>Xi Zhang</creator><creator>Chomicki, J.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200804</creationdate><title>On the semantics and evaluation of top-k queries in probabilistic databases</title><author>Xi Zhang ; Chomicki, J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1340-b6bdf1afcaa302fe51d199c57741a245ebb32fa81ea715d3a43400c4ecb7996f3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Bioinformatics</topic><topic>Biometrics</topic><topic>Biosensors</topic><topic>Cleaning</topic><topic>Computer science</topic><topic>Face recognition</topic><topic>Intelligent sensors</topic><topic>Query processing</topic><topic>Relational databases</topic><topic>Statistics</topic><toplevel>online_resources</toplevel><creatorcontrib>Xi Zhang</creatorcontrib><creatorcontrib>Chomicki, J.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Xi Zhang</au><au>Chomicki, J.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On the semantics and evaluation of top-k queries in probabilistic databases</atitle><btitle>2008 IEEE 24th International Conference on Data Engineering Workshop</btitle><stitle>ICDEW</stitle><date>2008-04</date><risdate>2008</risdate><spage>556</spage><epage>563</epage><pages>556-563</pages><isbn>1424421616</isbn><isbn>9781424421619</isbn><eisbn>1424421624</eisbn><eisbn>9781424421626</eisbn><abstract>We formulate three intuitive semantic properties for top-k queries in probabilistic databases, and propose Global-Topk query semantics which satisfies all of them. We provide a dynamic programming algorithm to evaluate top-k queries under Global-Topk in simple probabilistic relations. For general probabilistic relations, we show a polynomial reduction to the simple case. Our analysis shows that the complexity of query evaluation is linear in k and at most quadratic in database size.</abstract><pub>IEEE</pub><doi>10.1109/ICDEW.2008.4498380</doi><tpages>8</tpages><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISBN: 1424421616
ispartof	2008 IEEE 24th International Conference on Data Engineering Workshop, 2008, p.556-563
issn
language	eng
recordid	cdi_ieee_primary_4498380
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Bioinformatics Biometrics Biosensors Cleaning Computer science Face recognition Intelligent sensors Query processing Relational databases Statistics
title	On the semantics and evaluation of top-k queries in probabilistic databases
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T15%3A39%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20the%20semantics%20and%20evaluation%20of%20top-k%20queries%20in%20probabilistic%20databases&rft.btitle=2008%20IEEE%2024th%20International%20Conference%20on%20Data%20Engineering%20Workshop&rft.au=Xi%20Zhang&rft.date=2008-04&rft.spage=556&rft.epage=563&rft.pages=556-563&rft.isbn=1424421616&rft.isbn_list=9781424421619&rft_id=info:doi/10.1109/ICDEW.2008.4498380&rft_dat=%3Cieee_6IE%3E4498380%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424421624&rft.eisbn_list=9781424421626&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4498380&rfr_iscdi=true