作者: Wanbin Son , Fabian Stehn , Christian Knauer , Hee-Kap Ahn
DOI: 10.1016/J.IPL.2017.03.003
关键词:
摘要: Efficiently retrieving relevant data from a huge spatial database is and has been the subject of research in fields like systems, geographic information systems also computational geometry for many years. In this context, we study retrieval points with respect to query scoring function: let P Q be point sets plane, skyline consists which no other closer all Q. A set can seen as most “relevant” or “desirable” subset As large itself, it reasonable filter using function f, only reporting k best f.