Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations

This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a number of x-tuples, and each x-tuple randomly instantiates into one tuple from one or more alternatives. Our results sign...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on knowledge and data engineering Jg. 20; H. 12; S. 1669 - 1682
Hauptverfasser:	Ke Yi, Feifei Li, Kollios, G., Srivastava, D.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.12.2008 IEEE Computer Society The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Analysis of Algorithms and Problem Complexity Applied sciences Cleaning Complexity Computer science; control theory; systems Data models Data processing. List processing. Character string processing Database design Database Management Exact sciences and technology Information systems. Data bases Information Technology and Systems Mathematical models Memory organisation. Data processing modeling and management Polynomials Power system modeling Probability distribution Queries Query design and implementation languages Query processing Runtime Software Theoretical computing Theory of Computation Top-k Query Uncertain Database Uncertainty Web server x-Relation Model Top-k Query Analysis of Algorithms and Problem Complexity Uncertain Database Database design Query design and implementation languages x-Relation Model Database Management Theory of Computation Information Technology and Systems modeling and management Probabilistic approach Database query Hierarchical classification top-k Relational database Linear time probabilistic data Polynomial method Modeling Algorithm Polynomial time Uncertain system Query processing Algorithm complexity Database x-relation uncertain database Time complexity
ISSN:	1041-4347, 1558-2191
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!