k-ARQ: K-anonymous ranking queries

Eunjin Jung; Sukhyun Ahn; Seung Won Hwang

doi:10.1007/978-3-642-12026-8_32

k-ARQ: K-anonymous ranking queries

Eunjin Jung, Sukhyun Ahn, Seung Won Hwang

College of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

With the advent of an unprecedented magnitude of data, top-k queries have gained a lot of attention. However, existing work to date has focused on optimizing efficiency without looking closely at privacy preservation. In this paper, we study how existing approaches have failed to support a combination of accuracy and privacy requirements and we propose a new data publishing framework that supports both areas. We show that satisfying both requirements is an essential problem and propose two comprehensive algorithms. We also validated the correctness and efficiency of our approach using experiments.

Original language	English
Title of host publication	Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings
Pages	414-428
Number of pages	15
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-642-12026-8_32
Publication status	Published - 2010
Event	15th International Conference on Database Systems for Advanced Applications, DASFAA 2010 - Tsukuba, Japan Duration: 2010 Apr 1 → 2010 Apr 4

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	5981 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	15th International Conference on Database Systems for Advanced Applications, DASFAA 2010
Country/Territory	Japan
City	Tsukuba
Period	10/4/1 → 10/4/4

Bibliographical note

Funding Information:
This work was supported by Engineering Research Center of Excellence Program of Korea Ministry of Education, Science and Technology (MEST) / Korea Science and Engineering Foundation (KOSEF), grant number R11-2008-007-03003-0.

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-12026-8_32

Cite this

Jung, E., Ahn, S., & Hwang, S. W. (2010). k-ARQ: K-anonymous ranking queries. In Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings (PART 1 ed., pp. 414-428). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5981 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-12026-8_32

@inproceedings{2f699e4a0c974e7f8c4a99588d8aac64,

title = "k-ARQ: K-anonymous ranking queries",

abstract = "With the advent of an unprecedented magnitude of data, top-k queries have gained a lot of attention. However, existing work to date has focused on optimizing efficiency without looking closely at privacy preservation. In this paper, we study how existing approaches have failed to support a combination of accuracy and privacy requirements and we propose a new data publishing framework that supports both areas. We show that satisfying both requirements is an essential problem and propose two comprehensive algorithms. We also validated the correctness and efficiency of our approach using experiments.",

author = "Eunjin Jung and Sukhyun Ahn and Hwang, {Seung Won}",

note = "Funding Information: This work was supported by Engineering Research Center of Excellence Program of Korea Ministry of Education, Science and Technology (MEST) / Korea Science and Engineering Foundation (KOSEF), grant number R11-2008-007-03003-0.; 15th International Conference on Database Systems for Advanced Applications, DASFAA 2010 ; Conference date: 01-04-2010 Through 04-04-2010",

year = "2010",

doi = "10.1007/978-3-642-12026-8_32",

language = "English",

isbn = "3642120253",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 1",

pages = "414--428",

booktitle = "Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings",

edition = "PART 1",

}

Jung, E, Ahn, S & Hwang, SW 2010, k-ARQ: K-anonymous ranking queries. in Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 5981 LNCS, pp. 414-428, 15th International Conference on Database Systems for Advanced Applications, DASFAA 2010, Tsukuba, Japan, 10/4/1. https://doi.org/10.1007/978-3-642-12026-8_32

k-ARQ : K-anonymous ranking queries. / Jung, Eunjin; Ahn, Sukhyun; Hwang, Seung Won.

Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings. PART 1. ed. 2010. p. 414-428 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5981 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - k-ARQ

T2 - 15th International Conference on Database Systems for Advanced Applications, DASFAA 2010

AU - Jung, Eunjin

AU - Ahn, Sukhyun

AU - Hwang, Seung Won

N1 - Funding Information: This work was supported by Engineering Research Center of Excellence Program of Korea Ministry of Education, Science and Technology (MEST) / Korea Science and Engineering Foundation (KOSEF), grant number R11-2008-007-03003-0.

PY - 2010

Y1 - 2010

N2 - With the advent of an unprecedented magnitude of data, top-k queries have gained a lot of attention. However, existing work to date has focused on optimizing efficiency without looking closely at privacy preservation. In this paper, we study how existing approaches have failed to support a combination of accuracy and privacy requirements and we propose a new data publishing framework that supports both areas. We show that satisfying both requirements is an essential problem and propose two comprehensive algorithms. We also validated the correctness and efficiency of our approach using experiments.

AB - With the advent of an unprecedented magnitude of data, top-k queries have gained a lot of attention. However, existing work to date has focused on optimizing efficiency without looking closely at privacy preservation. In this paper, we study how existing approaches have failed to support a combination of accuracy and privacy requirements and we propose a new data publishing framework that supports both areas. We show that satisfying both requirements is an essential problem and propose two comprehensive algorithms. We also validated the correctness and efficiency of our approach using experiments.

UR - http://www.scopus.com/inward/record.url?scp=78650495007&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650495007&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-12026-8_32

DO - 10.1007/978-3-642-12026-8_32

M3 - Conference contribution

AN - SCOPUS:78650495007

SN - 3642120253

SN - 9783642120251

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 414

EP - 428

BT - Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings

Y2 - 1 April 2010 through 4 April 2010

ER -

Jung E, Ahn S, Hwang SW. k-ARQ: K-anonymous ranking queries. In Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings. PART 1 ed. 2010. p. 414-428. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-642-12026-8_32

k-ARQ: K-anonymous ranking queries

Abstract

Publication series

Other

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this