Kevin Chen-Chuan Chang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kevin Chen-Chuan Chang has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Hector Garcia-Molina
Computer Science Department, Stanford University, Stanford, CA 94305, USA
1 shared publication - Ihab F. Ilyas
Apple, Seattle, WA, USA
1 shared publication - Marianne Winslett
University of Illinois at Urbana-Champaign
1 shared publication - Mohamed A. Soliman
School of Computer Science, University of Waterloo
1 shared publication - Soumyadeb Mitra
University of Illinois at Urbana-Champaign
1 shared publication - Windsor W. Hsu
IBM Almaden Research Center
1 shared publication
Latest Publications
- 7 December 2018
- Published by Springer Nature
- p. 1041-1045
Deep-Web Search
- 15 December 2016
- Published by Springer Nature
- p. 1-5
Deep-Web Search
- 22 September 2007
- Published by Springer Nature in The VLDB Journal
- Vol. 17 (2) , 225-242
Trustworthy keyword search for compliance storage
- 22 September 2007
- Published by Springer Nature in The VLDB Journal
- Vol. 17 (2) , 225-242
Trustworthy keyword search for compliance storage
- Top Cited Papers
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 896-905
Top-k Query Processing in Uncertain Databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditional techniques inapplicable. We introduce new probabilistic formulations for top-k queries. Our formulations are based on "marriage" of traditional top-k semantics and possible worlds semantics. In the light of these formulations, we construct a framework that encapsulates a state space model and efficient query processing techniques to tackle the challenges of uncertain data settings. We prove that our techniques are optimal in terms of the number of accessed tuples and materialized search states. Our experiments show the efficiency of our techniques under different data distributions with orders of magnitude improvement over naive materialization of possible worlds.
- 1 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636382,p. 896-905
Top Cited PapersTop-k Query Processing in Uncertain Databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty makes traditional techniques inapplicable. We introduce new probabilistic formulations for top-k queries. Our formulations are based on "marriage" of traditional top-k semantics and possible worlds semantics. In the light of these formulations, we construct a framework that encapsulates a state space model and efficient query processing techniques to tackle the challenges of uncertain data settings. We prove that our techniques are optimal in terms of the number of accessed tuples and materialized search states. Our experiments show the efficiency of our techniques under different data distributions with orders of magnitude improvement over naive materialization of possible worlds.
- 1 September 2001
- Published by Springer Nature in The VLDB Journal
- Vol. 10 (2) , 155-181
Approximate query mapping: Accounting for translation closeness
- 1 September 2001
- Published by Springer Nature in The VLDB Journal
- Vol. 10 (2) , 155-181
Approximate query mapping: Accounting for translation closeness