Query batching optimization in database systems

•We study the query batching problem in database systems.•We develop a mixed binary quadratic program for the problem.•Our model relies on a novel regression-based processing-time prediction function.•We prove the proposed mixed binary quadratic program is an NP-hard problem.•We develop two heuristi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computers & operations research Ročník 121; s. 104983
Hlavní autoři: Eslami, Mehrad, Mahmoodian, Vahid, Dayarian, Iman, Charkhgard, Hadi, Tu, Yicheng
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Elsevier Ltd 01.09.2020
Pergamon Press Inc
Témata:
ISSN:0305-0548, 1873-765X, 0305-0548
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract •We study the query batching problem in database systems.•We develop a mixed binary quadratic program for the problem.•Our model relies on a novel regression-based processing-time prediction function.•We prove the proposed mixed binary quadratic program is an NP-hard problem.•We develop two heuristics and show their efficacy on three database benchmarks. Techniques based on sharing data and computation among queries have been an active research topic in database systems. While work in this area developed algorithms and systems that are shown to be effective, there is a lack of rigorous modeling and theoretical study for query processing and optimization. Query batching in database systems has strong resemblance to order batching in the warehousing context. While the latter is a well-studied problem, the literature on optimization techniques for query batching problem is quite scarce/nonexistent. In this study, we develop a Mixed Binary Quadratic Program (MBQP) to optimize query-batching in a database system. This model uses the coefficients of a linear regression on the query retrieval time, trained by a large set of randomly generated query sets. We also propose two heuristics, the so-called restricted-cardinality search methods I and II, for solving the proposed MBQP. To demonstrate the effectiveness of our proposed techniques, we conduct a comprehensive computational study over randomly generated instances of three well-known database benchmarks. The computational results show that when the proposed MBQP is solved using the designed heuristics, an improvement of up to 61.8% in retrieving time is achieved.
AbstractList •We study the query batching problem in database systems.•We develop a mixed binary quadratic program for the problem.•Our model relies on a novel regression-based processing-time prediction function.•We prove the proposed mixed binary quadratic program is an NP-hard problem.•We develop two heuristics and show their efficacy on three database benchmarks. Techniques based on sharing data and computation among queries have been an active research topic in database systems. While work in this area developed algorithms and systems that are shown to be effective, there is a lack of rigorous modeling and theoretical study for query processing and optimization. Query batching in database systems has strong resemblance to order batching in the warehousing context. While the latter is a well-studied problem, the literature on optimization techniques for query batching problem is quite scarce/nonexistent. In this study, we develop a Mixed Binary Quadratic Program (MBQP) to optimize query-batching in a database system. This model uses the coefficients of a linear regression on the query retrieval time, trained by a large set of randomly generated query sets. We also propose two heuristics, the so-called restricted-cardinality search methods I and II, for solving the proposed MBQP. To demonstrate the effectiveness of our proposed techniques, we conduct a comprehensive computational study over randomly generated instances of three well-known database benchmarks. The computational results show that when the proposed MBQP is solved using the designed heuristics, an improvement of up to 61.8% in retrieving time is achieved.
Techniques based on sharing data and computation among queries have been an active research topic in database systems. While work in this area developed algorithms and systems that are shown to be effective, there is a lack of rigorous modeling and theoretical study for query processing and optimization. Query batching in database systems has strong resemblance to order batching in the warehousing context. While the latter is a well-studied problem, the literature on optimization techniques for query batching problem is quite scarce/nonexistent. In this study, we develop a Mixed Binary Quadratic Program (MBQP) to optimize query-batching in a database system. This model uses the coefficients of a linear regression on the query retrieval time, trained by a large set of randomly generated query sets. We also propose two heuristics, the so-called restricted-cardinality search methods I and II, for solving the proposed MBQP. To demonstrate the effectiveness of our proposed techniques, we conduct a comprehensive computational study over randomly generated instances of three well-known database benchmarks. The computational results show that when the proposed MBQP is solved using the designed heuristics, an improvement of up to 61.8% in retrieving time is achieved.
ArticleNumber 104983
Author Dayarian, Iman
Mahmoodian, Vahid
Eslami, Mehrad
Tu, Yicheng
Charkhgard, Hadi
Author_xml – sequence: 1
  givenname: Mehrad
  orcidid: 0000-0001-9415-0541
  surname: Eslami
  fullname: Eslami, Mehrad
  organization: Department of Computer Science and Engineering, University of South Florida, Tampa, FL 33620, USA
– sequence: 2
  givenname: Vahid
  surname: Mahmoodian
  fullname: Mahmoodian, Vahid
  organization: Department of Industrial and Management Systems Engineering, University of South Florida, FL 33620, USA
– sequence: 3
  givenname: Iman
  orcidid: 0000-0002-9179-1973
  surname: Dayarian
  fullname: Dayarian, Iman
  organization: Culverhouse College of Business, The University of Alabama, Tuscaloosa, AL 35487, USA
– sequence: 4
  givenname: Hadi
  orcidid: 0000-0001-5416-6960
  surname: Charkhgard
  fullname: Charkhgard, Hadi
  email: hcharkhgard@usf.edu
  organization: Department of Industrial and Management Systems Engineering, University of South Florida, FL 33620, USA
– sequence: 5
  givenname: Yicheng
  surname: Tu
  fullname: Tu, Yicheng
  organization: Department of Computer Science and Engineering, University of South Florida, Tampa, FL 33620, USA
BookMark eNp9kE1LAzEQhoNUsK3-AG8LnrfNJPuJJyl-QUEEBW8hm8xqlnZTk1Sov96s68lD5zIMvM_MvO-MTHrbIyGXQBdAoVh2C2XdglE2zFld8RMyharkaVnkbxMypZzmKc2z6ozMvO9orJLBlCyf9-gOSSOD-jD9e2J3wWzNtwzG9onpEy2DbKTHxB98wK0_J6et3Hi8-Otz8np3-7J6SNdP94-rm3WqeF6GVINEaJpC16qITzUFb7ISqMpyzZikuipyCRKauBs105oh6LauIcs0rWVb8Dm5GvfunP3cow-is3vXx5OC5dEHAKeDCkaVctZ7h63YObOV7iCAiiEX0YmYixhyEWMukSn_McqEX7_BSbM5Sl6PJEbjXwad8Mpgr1AbhyoIbc0R-geaUH66
CitedBy_id crossref_primary_10_1051_jnwpu_20213940909
crossref_primary_10_1016_j_engappai_2023_107378
crossref_primary_10_1109_TKDE_2025_3597399
Cites_doi 10.1016/0305-0548(88)90028-7
10.1287/ijoc.5.4.410
10.14778/2850583.2850594
10.1080/00401706.1970.10488634
10.1145/369275.369291
10.14778/2168651.2168654
10.1145/42201.42203
10.1016/j.cor.2018.07.002
10.14778/2824032.2824044
10.1145/319702.319729
10.1145/362384.362685
10.1287/opre.2017.1620
10.1287/opre.31.3.507
10.1287/mnsc.47.10.1396.10265
10.1016/j.ejor.2008.09.011
10.1287/mnsc.45.4.575
ContentType Journal Article
Copyright 2020 Elsevier Ltd
Copyright Pergamon Press Inc. Sep 2020
Copyright_xml – notice: 2020 Elsevier Ltd
– notice: Copyright Pergamon Press Inc. Sep 2020
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.cor.2020.104983
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EISSN 1873-765X
0305-0548
ExternalDocumentID 10_1016_j_cor_2020_104983
S0305054820301003
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
186
1B1
1OL
1RT
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
6J9
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFJI
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
AAYOK
ABAOU
ABBOA
ABEFU
ABFNM
ABFRF
ABJNI
ABMAC
ABMMH
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACNCT
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADJOM
ADMUD
AEBSH
AEFWE
AEHXG
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
AKYCK
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOMHK
AOUOD
APLSM
ARUGR
ASPBG
AVARZ
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
H~9
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
PRBVW
Q38
R2-
RIG
ROL
RPZ
RXW
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSO
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
UAO
UPT
VH1
WUQ
XFK
XPP
ZMT
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
7SC
8FD
AGCQF
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c357t-d1ae1bb6d9c6202b63b4710c45d22a0d865a1a1babaed2dd2e1df99144d09af63
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000540716700008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0305-0548
IngestDate Wed Aug 13 11:34:52 EDT 2025
Sat Nov 29 07:24:10 EST 2025
Tue Nov 18 21:48:57 EST 2025
Fri Feb 23 02:46:47 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Database systems
Batching problem
Restricted-cardinality search method
Linear regression
Mixed binary quadratic programming
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c357t-d1ae1bb6d9c6202b63b4710c45d22a0d865a1a1babaed2dd2e1df99144d09af63
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-5416-6960
0000-0001-9415-0541
0000-0002-9179-1973
PQID 2505411306
PQPubID 45870
ParticipantIDs proquest_journals_2505411306
crossref_primary_10_1016_j_cor_2020_104983
crossref_citationtrail_10_1016_j_cor_2020_104983
elsevier_sciencedirect_doi_10_1016_j_cor_2020_104983
PublicationCentury 2000
PublicationDate 2020-09-01
PublicationDateYYYYMMDD 2020-09-01
PublicationDate_xml – month: 09
  year: 2020
  text: 2020-09-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Computers & operations research
PublicationYear 2020
Publisher Elsevier Ltd
Pergamon Press Inc
Publisher_xml – name: Elsevier Ltd
– name: Pergamon Press Inc
References Elmasri, Navathe (bib0005) 2015
Arumugam, Dobra, Jermaine, Pansare, Perez (bib0001) 2010
Garcia-Molina, Ullman, Widom (bib0007) 2008
Sellis (bib0026) 1988; 13
Ruben, Jacobs (bib0024) 1999; 45
Kester, Athanassoulis, Idreos (bib0013) 2017
Kuhn, Alapati, Padfield (bib0014) 2016
Ratliff, Rosenthal (bib0022) 1983; 31
Roussopoulos (bib0023) 1982; 7
Triantis, Egyhazy (bib0030) 1988; 15
TPC, 2001. Tpc benchmark by transaction processing performance council.
Hoerl, Kennard (bib0011) 1970; 12
Selinger, Astrahan, Chamberlin, Lorie, Price (bib0025) 1979
Wäscher (bib0032) 2004
Yu, de Koster (bib0033) 2009; 198
Link, 2015. Global database industry market size 2012–2017.
Oh, Kim, Lee, Moon (bib0017) 2015; 8
Harizopoulos, Shkapenyuk, Ailamaki (bib0010) 2005
Leis, Gubichev, Mirchev, Boncz, Kemper, Neumann (bib0015) 2015; 9
Codd (bib0002) 1970; 13
Coronel, Morris (bib0003) 2016
Sherali, Smith (bib0028) 2001; 47
Eslami, Tu, Charkghard (bib0006) 2019
Giannikis, Alonso, Kossmann (bib0008) 2012; 5
Giannikis, Makreshanski, Alonso, Kossmann (bib0009) 2013
Ramakrishnan Raghu (bib0021) 2000
Hoffer, Ramesh, Topi (bib0012) 2011
Pöss, Floyd (bib0020) 2000; 29
.
Poess, Nambiar, Walrath (bib0019) 2007; Vol. 7
Seppi, Barnes, Morris (bib0027) 1993; 5
Tsitsiklis, Xu (bib0031) 2017; 65
Elmasri, Navathe (bib0004) 2006
Pansart, Catusse, Cambazard (bib0018) 2018; 100
Codd (10.1016/j.cor.2020.104983_bib0002) 1970; 13
Ratliff (10.1016/j.cor.2020.104983_bib0022) 1983; 31
Eslami (10.1016/j.cor.2020.104983_bib0006) 2019
Ruben (10.1016/j.cor.2020.104983_bib0024) 1999; 45
Selinger (10.1016/j.cor.2020.104983_bib0025) 1979
Giannikis (10.1016/j.cor.2020.104983_bib0009) 2013
Hoffer (10.1016/j.cor.2020.104983_bib0012) 2011
Oh (10.1016/j.cor.2020.104983_bib0017) 2015; 8
10.1016/j.cor.2020.104983_bib0029
Giannikis (10.1016/j.cor.2020.104983_bib0008) 2012; 5
Elmasri (10.1016/j.cor.2020.104983_bib0004) 2006
Arumugam (10.1016/j.cor.2020.104983_bib0001) 2010
Seppi (10.1016/j.cor.2020.104983_bib0027) 1993; 5
Hoerl (10.1016/j.cor.2020.104983_bib0011) 1970; 12
Yu (10.1016/j.cor.2020.104983_sbref0031) 2009; 198
Harizopoulos (10.1016/j.cor.2020.104983_bib0010) 2005
Wäscher (10.1016/j.cor.2020.104983_bib0032) 2004
Kester (10.1016/j.cor.2020.104983_bib0013) 2017
Elmasri (10.1016/j.cor.2020.104983_bib0005) 2015
Tsitsiklis (10.1016/j.cor.2020.104983_bib0031) 2017; 65
Poess (10.1016/j.cor.2020.104983_bib0019) 2007; Vol. 7
10.1016/j.cor.2020.104983_bib0016
Kuhn (10.1016/j.cor.2020.104983_bib0014) 2016
Leis (10.1016/j.cor.2020.104983_bib0015) 2015; 9
Garcia-Molina (10.1016/j.cor.2020.104983_bib0007) 2008
Sellis (10.1016/j.cor.2020.104983_bib0026) 1988; 13
Pansart (10.1016/j.cor.2020.104983_bib0018) 2018; 100
Pöss (10.1016/j.cor.2020.104983_bib0020) 2000; 29
Ramakrishnan Raghu (10.1016/j.cor.2020.104983_bib0021) 2000
Roussopoulos (10.1016/j.cor.2020.104983_bib0023) 1982; 7
Triantis (10.1016/j.cor.2020.104983_bib0030) 1988; 15
Sherali (10.1016/j.cor.2020.104983_bib0028) 2001; 47
Coronel (10.1016/j.cor.2020.104983_bib0003) 2016
References_xml – volume: 13
  start-page: 23
  year: 1988
  end-page: 52
  ident: bib0026
  article-title: Multiple-query optimization
  publication-title: ACM Trans. Database Syst.
– year: 2008
  ident: bib0007
  article-title: Database systems: The complete book
– volume: 198
  start-page: 480
  year: 2009
  end-page: 490
  ident: bib0033
  article-title: The impact of order batching and picking area zoning on order picking system performance
  publication-title: European Journal of Operational Research
– start-page: 383
  year: 2005
  end-page: 394
  ident: bib0010
  article-title: Qpipe: a simultaneously pipelined relational query engine
  publication-title: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data
– volume: 5
  start-page: 410
  year: 1993
  end-page: 419
  ident: bib0027
  article-title: A bayesian approach to database query optimization
  publication-title: ORSA J. Comput.
– start-page: 519
  year: 2010
  end-page: 530
  ident: bib0001
  article-title: The datapath system: A data-centric analytic processing engine for large data warehouses
  publication-title: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data
– volume: 7
  start-page: 258
  year: 1982
  end-page: 290
  ident: bib0023
  article-title: View indexing in relational databases
  publication-title: ACM Trans. Database Syst.
– volume: 15
  start-page: 51
  year: 1988
  end-page: 60
  ident: bib0030
  article-title: An integer programming formulation embedded in an algorithm for query processing optimization in distributed relational database systems
  publication-title: Comput. Oper. Res.
– start-page: 1045
  year: 2013
  end-page: 1048
  ident: bib0009
  article-title: Workload optimization using shareddb
  publication-title: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
– volume: 8
  start-page: 1454
  year: 2015
  end-page: 1465
  ident: bib0017
  article-title: Sqlite optimization with phase change memory for mobile applications
  publication-title: Proc. VLDB Endow.
– start-page: 323
  year: 2004
  end-page: 347
  ident: bib0032
  article-title: Order Picking: A Survey of Planning Problems and Methods
– year: 2019
  ident: bib0006
  article-title: A system for batched query processing and optimization
  publication-title: Technical Report
– year: 2016
  ident: bib0003
  article-title: Database systems: Design, implementation, & management
– volume: 65
  start-page: 1398
  year: 2017
  end-page: 1413
  ident: bib0031
  article-title: Flexible queuing architectures
  publication-title: Oper. Res.
– volume: 47
  start-page: 1396
  year: 2001
  end-page: 1407
  ident: bib0028
  article-title: Improving discrete model representations via symmetry considerations
  publication-title: Manage. Sci.
– year: 2016
  ident: bib0014
  article-title: Expert oracle indexing and access paths: Maximum performance for your database
– volume: 9
  start-page: 204
  year: 2015
  end-page: 215
  ident: bib0015
  article-title: How good are query optimizers, really?
  publication-title: Proc. VLDB Endow.
– volume: 13
  start-page: 377
  year: 1970
  end-page: 387
  ident: bib0002
  article-title: A relational model of data for large shared data banks
  publication-title: Commun. ACM
– volume: Vol. 7
  start-page: 1138
  year: 2007
  end-page: 1149
  ident: bib0019
  article-title: Why you should run tpc-ds: a workload analysis.
  publication-title: VLDB
– reference: TPC, 2001. Tpc benchmark by transaction processing performance council.
– year: 2011
  ident: bib0012
  article-title: Modern database management
– volume: 100
  start-page: 117
  year: 2018
  end-page: 127
  ident: bib0018
  article-title: Exact algorithms for the order picking problem
  publication-title: Comput. Oper. Res.
– year: 2000
  ident: bib0021
  article-title: Database Management Systems
– reference: .
– volume: 45
  start-page: 575
  year: 1999
  end-page: 596
  ident: bib0024
  article-title: Batch construction heuristics and storage assignment strategies for walk/ride and pick systems
  publication-title: Manage. Sci.
– start-page: 23
  year: 1979
  end-page: 34
  ident: bib0025
  article-title: Access path selection in a relational database management system
  publication-title: Proceedings of the 1979 ACM SIGMOD international conference on Management of data
– year: 2006
  ident: bib0004
  article-title: Fundamentals of DATABASE SYSTEMS (5TH EDition)
– volume: 12
  start-page: 55
  year: 1970
  end-page: 67
  ident: bib0011
  article-title: Ridge regression: biased estimation for nonorthogonal problems
  publication-title: Technometrics
– start-page: 715
  year: 2017
  end-page: 730
  ident: bib0013
  article-title: Access path selection in main-memory optimized data systems: Should i scan or should i probe?
  publication-title: Proceedings of the 2017 ACM International Conference on Management of Data
– volume: 31
  start-page: 507
  year: 1983
  end-page: 521
  ident: bib0022
  article-title: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem
  publication-title: Oper. Res.
– volume: 5
  start-page: 526
  year: 2012
  end-page: 537
  ident: bib0008
  article-title: Shareddb: killing one thousand queries with one stone
  publication-title: Proc. VLDB Endow.
– reference: Link, 2015. Global database industry market size 2012–2017.
– volume: 29
  start-page: 64
  year: 2000
  end-page: 71
  ident: bib0020
  article-title: New TPC benchmarks for decision support and web commerce
  publication-title: SIGMOD Record
– year: 2015
  ident: bib0005
  article-title: Fundamentals of DATABASE Systems
– year: 2016
  ident: 10.1016/j.cor.2020.104983_bib0014
– start-page: 715
  year: 2017
  ident: 10.1016/j.cor.2020.104983_bib0013
  article-title: Access path selection in main-memory optimized data systems: Should i scan or should i probe?
– ident: 10.1016/j.cor.2020.104983_bib0029
– volume: 15
  start-page: 51
  issue: 1
  year: 1988
  ident: 10.1016/j.cor.2020.104983_bib0030
  article-title: An integer programming formulation embedded in an algorithm for query processing optimization in distributed relational database systems
  publication-title: Comput. Oper. Res.
  doi: 10.1016/0305-0548(88)90028-7
– volume: 5
  start-page: 410
  issue: 4
  year: 1993
  ident: 10.1016/j.cor.2020.104983_bib0027
  article-title: A bayesian approach to database query optimization
  publication-title: ORSA J. Comput.
  doi: 10.1287/ijoc.5.4.410
– volume: 9
  start-page: 204
  issue: 3
  year: 2015
  ident: 10.1016/j.cor.2020.104983_bib0015
  article-title: How good are query optimizers, really?
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/2850583.2850594
– volume: 12
  start-page: 55
  issue: 1
  year: 1970
  ident: 10.1016/j.cor.2020.104983_bib0011
  article-title: Ridge regression: biased estimation for nonorthogonal problems
  publication-title: Technometrics
  doi: 10.1080/00401706.1970.10488634
– year: 2011
  ident: 10.1016/j.cor.2020.104983_bib0012
– volume: 29
  start-page: 64
  issue: 4
  year: 2000
  ident: 10.1016/j.cor.2020.104983_bib0020
  article-title: New TPC benchmarks for decision support and web commerce
  publication-title: SIGMOD Record
  doi: 10.1145/369275.369291
– start-page: 23
  year: 1979
  ident: 10.1016/j.cor.2020.104983_bib0025
  article-title: Access path selection in a relational database management system
– ident: 10.1016/j.cor.2020.104983_bib0016
– volume: Vol. 7
  start-page: 1138
  year: 2007
  ident: 10.1016/j.cor.2020.104983_bib0019
  article-title: Why you should run tpc-ds: a workload analysis.
– volume: 5
  start-page: 526
  issue: 6
  year: 2012
  ident: 10.1016/j.cor.2020.104983_bib0008
  article-title: Shareddb: killing one thousand queries with one stone
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/2168651.2168654
– start-page: 1045
  year: 2013
  ident: 10.1016/j.cor.2020.104983_bib0009
  article-title: Workload optimization using shareddb
– start-page: 383
  year: 2005
  ident: 10.1016/j.cor.2020.104983_bib0010
  article-title: Qpipe: a simultaneously pipelined relational query engine
– volume: 13
  start-page: 23
  issue: 1
  year: 1988
  ident: 10.1016/j.cor.2020.104983_bib0026
  article-title: Multiple-query optimization
  publication-title: ACM Trans. Database Syst.
  doi: 10.1145/42201.42203
– year: 2019
  ident: 10.1016/j.cor.2020.104983_bib0006
  article-title: A system for batched query processing and optimization
– volume: 100
  start-page: 117
  year: 2018
  ident: 10.1016/j.cor.2020.104983_bib0018
  article-title: Exact algorithms for the order picking problem
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2018.07.002
– year: 2008
  ident: 10.1016/j.cor.2020.104983_bib0007
– volume: 8
  start-page: 1454
  issue: 12
  year: 2015
  ident: 10.1016/j.cor.2020.104983_bib0017
  article-title: Sqlite optimization with phase change memory for mobile applications
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/2824032.2824044
– volume: 7
  start-page: 258
  issue: 2
  year: 1982
  ident: 10.1016/j.cor.2020.104983_bib0023
  article-title: View indexing in relational databases
  publication-title: ACM Trans. Database Syst.
  doi: 10.1145/319702.319729
– start-page: 323
  year: 2004
  ident: 10.1016/j.cor.2020.104983_bib0032
– year: 2000
  ident: 10.1016/j.cor.2020.104983_bib0021
– start-page: 519
  year: 2010
  ident: 10.1016/j.cor.2020.104983_bib0001
  article-title: The datapath system: A data-centric analytic processing engine for large data warehouses
– volume: 13
  start-page: 377
  issue: 6
  year: 1970
  ident: 10.1016/j.cor.2020.104983_bib0002
  article-title: A relational model of data for large shared data banks
  publication-title: Commun. ACM
  doi: 10.1145/362384.362685
– year: 2016
  ident: 10.1016/j.cor.2020.104983_bib0003
– volume: 65
  start-page: 1398
  issue: 5
  year: 2017
  ident: 10.1016/j.cor.2020.104983_bib0031
  article-title: Flexible queuing architectures
  publication-title: Oper. Res.
  doi: 10.1287/opre.2017.1620
– volume: 31
  start-page: 507
  issue: 3
  year: 1983
  ident: 10.1016/j.cor.2020.104983_bib0022
  article-title: Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem
  publication-title: Oper. Res.
  doi: 10.1287/opre.31.3.507
– volume: 47
  start-page: 1396
  issue: 10
  year: 2001
  ident: 10.1016/j.cor.2020.104983_bib0028
  article-title: Improving discrete model representations via symmetry considerations
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.47.10.1396.10265
– volume: 198
  start-page: 480
  issue: 2
  year: 2009
  ident: 10.1016/j.cor.2020.104983_sbref0031
  article-title: The impact of order batching and picking area zoning on order picking system performance
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2008.09.011
– year: 2006
  ident: 10.1016/j.cor.2020.104983_bib0004
– volume: 45
  start-page: 575
  issue: 4
  year: 1999
  ident: 10.1016/j.cor.2020.104983_bib0024
  article-title: Batch construction heuristics and storage assignment strategies for walk/ride and pick systems
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.45.4.575
– year: 2015
  ident: 10.1016/j.cor.2020.104983_bib0005
SSID ssj0000721
Score 2.341003
Snippet •We study the query batching problem in database systems.•We develop a mixed binary quadratic program for the problem.•Our model relies on a novel...
Techniques based on sharing data and computation among queries have been an active research topic in database systems. While work in this area developed...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 104983
SubjectTerms Algorithms
Batching problem
Database systems
Heuristic methods
Linear regression
Mixed binary quadratic programming
Operations research
Optimization
Optimization techniques
Queries
Query processing
Restricted-cardinality search method
System effectiveness
Title Query batching optimization in database systems
URI https://dx.doi.org/10.1016/j.cor.2020.104983
https://www.proquest.com/docview/2505411306
Volume 121
WOSCitedRecordID wos000540716700008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-765X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000721
  issn: 0305-0548
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZQixAceCwgCgXlwAkUyMOP5FjBIoqgAlHQ3iw7dtgtbLJKtqj994xfybKICpC4RKs87MTz7Xg8_mYGocc5rTHVVRmzhBSmhJmKpSyrmFQ6AXO2ptiyKj-_ZUdHxWxWvvfhir0tJ8Capjg7K1f_VdRwDoRtQmf_QtxDo3ACfoPQ4Qhih-MfCf7Dqe7On0pQsda51IJOWPpgS0t9FWthpi6fw7nftE5DiYfeAqJd6c4T5XxKoMF1PDVAsjyAd3reCTX6tefLtjWQs_xZMV8Ml16Kc1iWuwuHyxGTZr__6_yLcBR7UISLTUcErDoD08p7x0KEzEhHslFZhhxIXDbNZ9op2YLlMaNk9pMWdoHSv2h051w4AYGY7K2Z3ZQuXe2brUTZH01fpqvMLPNsCtjdjJESdN3uweF09macoZmNxxveLex2W97fVke_s1e2Zm5rjhzfRNf9OiI6cPK_hS7pZoKuhDCGCboRZBl57T1B1zZyT95Gzy1OooCTaBMn0aKJAk4ij5M76NOr6fGL17GvnhFXOWHrWKVCp1JSVVYUvkfSXIIhklSYqCwTiSooEalIJbSlVaZUplNVw2oBY5WUoqb5XbTTtI2-h6BHrGRdg_4WDIu6KFJS51QpsIWZIirdQ0kYI1751PKmwsk3HjiEJxyGlZth5W5Y99CT4ZGVy6ty0c04DDz3hqEz-Dig5KLH9oOQuP-D9tyY_DgFy43e_7dWH6CrI_r30c66O9UP0eXq-3rRd4881H4AIQ-P5A
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Query+batching+optimization+in+database+systems&rft.jtitle=Computers+%26+operations+research&rft.au=Eslami%2C+Mehrad&rft.au=Mahmoodian%2C+Vahid&rft.au=Dayarian%2C+Iman&rft.au=Charkhgard%2C+Hadi&rft.date=2020-09-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.eissn=1873-765X&rft.volume=121&rft_id=info:doi/10.1016%2Fj.cor.2020.104983&rft.externalDocID=S0305054820301003
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon