Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient computation for probabilistic skyline over uncertain preferences

From MaRDI portal
Publication:1750054
Jump to:navigation, search

DOI10.1016/j.ins.2015.06.041zbMath1390.68248OpenAlexW820384619WikidataQ58194973 ScholiaQ58194973MaRDI QIDQ1750054

Venkateswara Rao Kagita, Vineet Padmanabhan, Arun K. Pujari, Anubhuti Garg

Publication date: 17 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.06.041


zbMATH Keywords

skyline computationuncertain preferencesskyline query


Mathematics Subject Classification ID

Database theory (68P15)


Related Items (3)

Bounds on skyline probability for databases with uncertain preferences ⋮ Optimizing skyline queries over incomplete data ⋮ \(k\)-dominant skyline queries on incomplete data



Cites Work

  • (Approximate) uncertain skylines
  • Bi-directional Search for Skyline Probability




This page was built for publication: Efficient computation for probabilistic skyline over uncertain preferences

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1750054&oldid=14090792"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 06:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki