{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T06:10:24Z","timestamp":1691993424516},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2015,8]]},"abstract":"<jats:p>Business rule management is the task of storing and maintaining company-specific decision rules and business logic that is queried frequently by application users. These rules can impede efficient query processing when they require the business rule engine to resolve semantic hierarchies. To address this problem, this work discusses hierarchical indexes that are performance and storage-conscious. In the first part of this work, we develop a tree-based hierarchical structure that represents client-defined semantic hierarchies as well as two variants of this structure that improve performance and main memory allocation. The second part of our work focuses on selecting the top rules out of those retrieved from the index. We formally define a priority score-based decision scheme that allows for a conflict-free rule system and efficient rule ranking. Additionally, we introduce a weight-based lazy merging technique for rule selection. All of these techniques are evaluated with real world and synthetic data sets.<\/jats:p>","DOI":"10.14778\/2824032.2824064","type":"journal-article","created":{"date-parts":[[2015,9,16]],"date-time":"2015-09-16T12:18:17Z","timestamp":1442405897000},"page":"1656-1667","source":"Crossref","is-referenced-by-count":3,"title":["Indexing and selecting hierarchical business logic"],"prefix":"10.14778","volume":"8","author":[{"given":"Alessandra","family":"Loro","sequence":"first","affiliation":[{"name":"Palantir Technologies"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anja","family":"Gruenheid","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald","family":"Kossmann","sequence":"additional","affiliation":[{"name":"ETH Zurich and Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Profeta","sequence":"additional","affiliation":[{"name":"S.A.S. Amadeus"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Beaudequin","sequence":"additional","affiliation":[{"name":"S.A.S. Amadeus"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,8]]},"reference":[{"issue":"5","key":"e_1_2_1_1_1","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","article-title":"Decomposable searching problems","volume":"8","author":"J.","year":"1979","journal-title":"Information Processing Letters"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/584792.584801","volume-title":"CIKM","author":"Calado","year":"2002"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"J. Celko. Joe Celko's Trees and Hierarchies in SQL for Smarties. Morgan Kaufmann 2004. J. Celko. Joe Celko's Trees and Hierarchies in SQL for Smarties. Morgan Kaufmann 2004.","DOI":"10.1016\/B978-155860920-4\/50002-7"},{"key":"e_1_2_1_4_1","first-page":"662","volume-title":"ECIR","author":"Petkova Desislava","year":"2009"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/375551.375567","volume-title":"PODS","author":"Fagin R.","year":"2001"},{"key":"e_1_2_1_6_1","first-page":"436","volume-title":"VLDB","author":"Goldman R.","year":"1997"},{"key":"e_1_2_1_7_1","first-page":"16","volume-title":"SIGMOD","author":"Shao Lin","year":"2003"},{"key":"e_1_2_1_8_1","volume-title":"Inc.","author":"Halle B. V.","year":"2001"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/93605.98736"},{"key":"e_1_2_1_10_1","volume-title":"Whitepaper","author":"IBM Corporation","year":"2012"},{"key":"e_1_2_1_11_1","first-page":"1","volume-title":"CIKM","author":"Krishnamurthy Guy","year":"1998"},{"key":"e_1_2_1_12_1","first-page":"180","volume-title":"VLDB","author":"Kilger C.","year":"1994"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"W. Kim K. Kim and A. G. Dale. Indexing Techniques for Object-Oriented Databases. Object-Oriented Concepts Databases and Applications pages 371--394 1989. 10.1145\/63320.66510 W. Kim K. Kim and A. G. Dale. Indexing Techniques for Object-Oriented Databases. Object-Oriented Concepts Databases and Applications pages 371--394 1989. 10.1145\/63320.66510","DOI":"10.1145\/63320.66510"},{"key":"e_1_2_1_14_1","first-page":"91","volume-title":"Index Structures for Structured Documents. International Conference on Digital Libraries","author":"Lee Y. K.","year":"1996"},{"key":"e_1_2_1_15_1","first-page":"361","volume-title":"VLDB","author":"Li Q.","year":"2001"},{"key":"e_1_2_1_16_1","volume-title":"WWW","author":"Sifer Olivier","year":"1998"},{"key":"e_1_2_1_17_1","first-page":"134","volume-title":"SIGMOD","author":"Low C. C.","year":"1992"},{"key":"e_1_2_1_18_1","volume-title":"Business Whitepaper","year":"2005"},{"key":"e_1_2_1_19_1","unstructured":"T. Sellis and C.-C. Lin. A Geometric Approach to Indexing of Large Rule Bases. Report No. UMIACS-TR-91-101 1991. T. Sellis and C.-C. Lin. A Geometric Approach to Indexing of Large Rule Bases. Report No. UMIACS-TR-91-101 1991."},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s007990050005","article-title":"The Lorel Query Language for Semistructured Data","volume":"1","author":"Abiteboul Serge","year":"1997","journal-title":"International Journal on Digital Libraries"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/276675.276702","volume-title":"Proceedings of the Third ACM Conference on Digital Libraries","author":"Shin D.","year":"1998"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"G. Varghese. Prefix-Match Lookups. Network Algorithmics pages 233--266 2005. G. Varghese. Prefix-Match Lookups. Network Algorithmics pages 233--266 2005.","DOI":"10.1016\/B978-012088477-3\/50014-X"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2824032.2824064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T05:50:02Z","timestamp":1691992202000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2824032.2824064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8]]},"references-count":22,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["10.14778\/2824032.2824064"],"URL":"https:\/\/doi.org\/10.14778\/2824032.2824064","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2015,8]]}}}