Boolean + ranking: Querying a database by k-constrained optimization

Zhen Zhang, Seung Won Hwang, Kevin Chen Chuan Chang, Min Wang, Christian A. Lang, Yuan Chi Chang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

31 Citations (Scopus)

Abstract

The wide spread of databases for managing structured data, compounded with the expanded reach of the Internet, has brought forward interesting data retrieval and analysis scenarios to RDBMS. In such settings, queries often take the form of k-constrained optimization, with a Boolean constraint and a numeric optimization expression as the goal function, retrieving only the top-k tuples. This paper proposes the concept of supporting such queries, as their nature implies, by a functional optimization machinery over the search space of multiple indices. To realize this concept, we combine the dual perspectives of discrete state search (from the view of indices) and continuous function optimization (from the view of goal functions). We present, as the marriage of the two perspectives, the OPT*framework, which encodes k-constrained optimization as an A*search over the composite space of multiple indices, driven by functional optimization for providing tight heuristics. By processing queries as optimization, OPT*significantly outperforms baseline approaches, with up to 3 orders of magnitude margins.

Original languageEnglish
Title of host publicationSIGMOD 2006 - Proceedings of the ACM SIGMOD International Conference on Management of Data
Pages359-370
Number of pages12
DOIs
Publication statusPublished - 2006 Dec 1
Event2006 ACM SIGMOD International Conference on Management of Data - Chicago, IL, United States
Duration: 2006 Jun 272006 Jun 29

Publication series

NameProceedings of the ACM SIGMOD International Conference on Management of Data
ISSN (Print)0730-8078

Other

Other2006 ACM SIGMOD International Conference on Management of Data
CountryUnited States
CityChicago, IL
Period06/6/2706/6/29

Fingerprint

Constrained optimization
Query processing
Machinery
Internet
Composite materials

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems

Cite this

Zhang, Z., Hwang, S. W., Chang, K. C. C., Wang, M., Lang, C. A., & Chang, Y. C. (2006). Boolean + ranking: Querying a database by k-constrained optimization. In SIGMOD 2006 - Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 359-370). (Proceedings of the ACM SIGMOD International Conference on Management of Data). https://doi.org/10.1145/1142473.1142515
Zhang, Zhen ; Hwang, Seung Won ; Chang, Kevin Chen Chuan ; Wang, Min ; Lang, Christian A. ; Chang, Yuan Chi. / Boolean + ranking : Querying a database by k-constrained optimization. SIGMOD 2006 - Proceedings of the ACM SIGMOD International Conference on Management of Data. 2006. pp. 359-370 (Proceedings of the ACM SIGMOD International Conference on Management of Data).
@inproceedings{3dfccdb7dae64b78b5b276cfc8e15333,
title = "Boolean + ranking: Querying a database by k-constrained optimization",
abstract = "The wide spread of databases for managing structured data, compounded with the expanded reach of the Internet, has brought forward interesting data retrieval and analysis scenarios to RDBMS. In such settings, queries often take the form of k-constrained optimization, with a Boolean constraint and a numeric optimization expression as the goal function, retrieving only the top-k tuples. This paper proposes the concept of supporting such queries, as their nature implies, by a functional optimization machinery over the search space of multiple indices. To realize this concept, we combine the dual perspectives of discrete state search (from the view of indices) and continuous function optimization (from the view of goal functions). We present, as the marriage of the two perspectives, the OPT*framework, which encodes k-constrained optimization as an A*search over the composite space of multiple indices, driven by functional optimization for providing tight heuristics. By processing queries as optimization, OPT*significantly outperforms baseline approaches, with up to 3 orders of magnitude margins.",
author = "Zhen Zhang and Hwang, {Seung Won} and Chang, {Kevin Chen Chuan} and Min Wang and Lang, {Christian A.} and Chang, {Yuan Chi}",
year = "2006",
month = "12",
day = "1",
doi = "10.1145/1142473.1142515",
language = "English",
isbn = "1595934340",
series = "Proceedings of the ACM SIGMOD International Conference on Management of Data",
pages = "359--370",
booktitle = "SIGMOD 2006 - Proceedings of the ACM SIGMOD International Conference on Management of Data",

}

Zhang, Z, Hwang, SW, Chang, KCC, Wang, M, Lang, CA & Chang, YC 2006, Boolean + ranking: Querying a database by k-constrained optimization. in SIGMOD 2006 - Proceedings of the ACM SIGMOD International Conference on Management of Data. Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 359-370, 2006 ACM SIGMOD International Conference on Management of Data, Chicago, IL, United States, 06/6/27. https://doi.org/10.1145/1142473.1142515

Boolean + ranking : Querying a database by k-constrained optimization. / Zhang, Zhen; Hwang, Seung Won; Chang, Kevin Chen Chuan; Wang, Min; Lang, Christian A.; Chang, Yuan Chi.

SIGMOD 2006 - Proceedings of the ACM SIGMOD International Conference on Management of Data. 2006. p. 359-370 (Proceedings of the ACM SIGMOD International Conference on Management of Data).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Boolean + ranking

T2 - Querying a database by k-constrained optimization

AU - Zhang, Zhen

AU - Hwang, Seung Won

AU - Chang, Kevin Chen Chuan

AU - Wang, Min

AU - Lang, Christian A.

AU - Chang, Yuan Chi

PY - 2006/12/1

Y1 - 2006/12/1

N2 - The wide spread of databases for managing structured data, compounded with the expanded reach of the Internet, has brought forward interesting data retrieval and analysis scenarios to RDBMS. In such settings, queries often take the form of k-constrained optimization, with a Boolean constraint and a numeric optimization expression as the goal function, retrieving only the top-k tuples. This paper proposes the concept of supporting such queries, as their nature implies, by a functional optimization machinery over the search space of multiple indices. To realize this concept, we combine the dual perspectives of discrete state search (from the view of indices) and continuous function optimization (from the view of goal functions). We present, as the marriage of the two perspectives, the OPT*framework, which encodes k-constrained optimization as an A*search over the composite space of multiple indices, driven by functional optimization for providing tight heuristics. By processing queries as optimization, OPT*significantly outperforms baseline approaches, with up to 3 orders of magnitude margins.

AB - The wide spread of databases for managing structured data, compounded with the expanded reach of the Internet, has brought forward interesting data retrieval and analysis scenarios to RDBMS. In such settings, queries often take the form of k-constrained optimization, with a Boolean constraint and a numeric optimization expression as the goal function, retrieving only the top-k tuples. This paper proposes the concept of supporting such queries, as their nature implies, by a functional optimization machinery over the search space of multiple indices. To realize this concept, we combine the dual perspectives of discrete state search (from the view of indices) and continuous function optimization (from the view of goal functions). We present, as the marriage of the two perspectives, the OPT*framework, which encodes k-constrained optimization as an A*search over the composite space of multiple indices, driven by functional optimization for providing tight heuristics. By processing queries as optimization, OPT*significantly outperforms baseline approaches, with up to 3 orders of magnitude margins.

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

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

U2 - 10.1145/1142473.1142515

DO - 10.1145/1142473.1142515

M3 - Conference contribution

AN - SCOPUS:34250659815

SN - 1595934340

SN - 9781595934345

T3 - Proceedings of the ACM SIGMOD International Conference on Management of Data

SP - 359

EP - 370

BT - SIGMOD 2006 - Proceedings of the ACM SIGMOD International Conference on Management of Data

ER -

Zhang Z, Hwang SW, Chang KCC, Wang M, Lang CA, Chang YC. Boolean + ranking: Querying a database by k-constrained optimization. In SIGMOD 2006 - Proceedings of the ACM SIGMOD International Conference on Management of Data. 2006. p. 359-370. (Proceedings of the ACM SIGMOD International Conference on Management of Data). https://doi.org/10.1145/1142473.1142515