Evaluating top-N queries in n-dimensional normed spaces

DOI10.1016/J.INS.2016.09.035MaRDI QIDQ2282287zbMATH OpenOpenAlexFDO

Authors Liang Zhu, FeiFei Liu, Weiyi Meng, Qin Ma, Yu Wang, Fang Yuan

Publication date 7 January 2020

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

\(n\)-dimensional normed spaceranking functionrelational databasetop-\(N\) query

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Foundations of Information and Knowledge Systems
• Processing Top-k Dominating Queries in Metric Spaces
• Efficient top-k queries for orthogonal ranges
• Efficient top-k query calculation in distributed networks
• Colored top-\(K\) range-aggregate queries

Cites work

• Approximate nearest neighbor: towards removing the curse of dimensionality
• Combining fuzzy information from multiple systems
• scientific article; zbMATH DE number 3890132 (Why is no real title available?)
• scientific article; zbMATH DE number 1559575 (Why is no real title available?)
• Lower bounds for high dimensional nearest neighbor search and related problems
• Optimal aggregation algorithms for middleware.
• Similarity estimation techniques from rounding algorithms
• TJJE: an efficient algorithm for top-\(k\) join on massive data

Cited in

(4)

• Supporting early pruning in top-\(k\) query processing on massive data
• scientific article; zbMATH DE number 1717354 (Why is no real title available?)
• Efficient evaluation of monitoring top-\(t\) most influential places
• Foundations of Information and Knowledge Systems

This page was built for publication: Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2282287)