Efficient top- K approximate searches against a relation with multiple attributes

Author： Lu Wei  

Publisher： Springer Publishing Company

ISSN： 1386-145X

Source： World Wide Web, Vol.14, Iss.5-6, 2011-10, pp. : 573-597

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Approximate distributed top-k queries

By Patt-Shamir Boaz   Shafrir Allon  

Distributed Computing, Vol. 21, Iss. 1, 2008-06 ,pp. : 1-22

Springer Publishing Company

Access to resources Recommend Favorite

Top- k typicality queries and efficient query answering methods on large databases

By Hua Ming  

The VLDB Journal, Vol. 18, Iss. 3, 2009-06 ,pp. : 809-835

Springer Publishing Company

Access to resources Recommend Favorite

Enhanced A * algorithms for multiple alignments: optimal alignments for several sequences and k-opt approximate alignments for large cases

By Ikeda T.   Imai H.  

Theoretical Computer Science, Vol. 210, Iss. 2, 1999-01 ,pp. : 341-374

Elsevier

Access to resources Recommend Favorite

General and Efficient Multisplitting of Numerical Attributes

By Elomaa T.  

Machine Learning, Vol. 36, Iss. 3, 1999-09 ,pp. : 201-244

Springer Publishing Company

Access to resources Recommend Favorite

A top-down approach for approximate data anonymisation

By Li JianQiang  

Enterprise Information Systems, Vol. 7, Iss. 3, 2013-08 ,pp. : 272-302

Taylor & Francis Ltd

Access to resources Recommend Favorite