Branch-and-bound algorithm for reverse top-k queries

by Akrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg, Yannis Kotidis

Published in ACM SIGMOD Conference by ACM Press.

p481-492 (2013)

application/pdf 292.1 kB `file_7atqrkxqf5ffvbo3ukhpeti56y`	web.archive.org (webarchive) www.idi.ntnu.no (web) web.archive.org (webarchive) www.idi.ntnu.no (web)
application/pdf 286.3 kB `file_zqqlnzbmfvekpk4gxg22qtxo4m`	web.archive.org (webarchive) pages.cs.aueb.gr (web)

Archived

Type paper-conference
Stage

published

Year 2013

DOI 10.1145/2463676.2465278
dblp conf/sigmod/VlachouDNK13

Container Metadata
Not in DOAJ
Not in Keepers Registry

Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)

Cite This

BibTeX
CSL-JSON
MLA
Harvard

Lookup Links

Catalog Record
Revision: 193daff0-7c5d-49d8-954d-a7ea6545eb24
API URL: JSON

Branch-and-bound algorithm for reverse top-k queries release_56mcl6wcy5bo7luwbdqlduotzm