Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Indexing and selecting hierarchical business logic

Published: 01 August 2015 Publication History

Abstract

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.

References

[1]
Bentley, J. L. Decomposable searching problems. Information Processing Letters, 8(5):244--251, 1979.
[2]
Calado, Pável and da Silva, Altigran Soares and Vieira, Rodrigo C. and Laender, Alberto H. F. and Ribeiro-Neto, Berthier A. Searching Web Databases by Structuring Keyword-based Queries. CIKM, pages 26--33, 2002.
[3]
J. Celko. Joe Celko's Trees and Hierarchies in SQL for Smarties. Morgan Kaufmann, 2004.
[4]
Desislava Petkova and W. Bruce Croft and Yanlei Diao. Refining Keyword Queries for XML Retrieval by Combining Content and Structure. ECIR, pages 662--669, 2009.
[5]
R. Fagin, A. Lotem, and M. Naor. Optimal Aggregation Algorithms for Middleware. PODS, pages 102--113, 2001.
[6]
R. Goldman and J. Widom. DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases. VLDB, pages 436--445, 1997.
[7]
Guo, Lin and Shao, Feng and Botev, Chavdar and Shanmugasundaram, Jayavel. XRANK: Ranked Keyword Search over XML Documents. SIGMOD, pages 16--27, 2003.
[8]
B. V. Halle. Business Rules Applied: Building Better Systems Using the Business Rules Approach. John Wiley & Sons, Inc., 2001.
[9]
E. N. Hanson, M. Chaabouni, C.-H. Kim, and Y.-W. Wang. A predicate matching algorithm for database rule systems. SIGMOD, 19(2):271--280, May 1990.
[10]
IBM Corporation. IBM Operational Decision Manager. Whitepaper, 2012.
[11]
Jacobson, Guy and Krishnamurthy, Balachander and Srivastava, Divesh and Suciu, Dan. Focusing Search in Hierarchical Structures with Directory Sets. CIKM, pages 1--9, 1998.
[12]
C. Kilger and G. Moerkotte. Indexing Multiple Sets. VLDB, pages 180--191, 1994.
[13]
W. Kim, K. Kim, and A. G. Dale. Indexing Techniques for Object-Oriented Databases. Object-Oriented Concepts, Databases, and Applications, pages 371--394, 1989.
[14]
Y. K. Lee, S.-J. Yoo, K. Yoon, and P. B. Berra. Index Structures for Structured Documents. International Conference on Digital Libraries, pages 91--99, 1996.
[15]
Q. Li and B. Moon. Indexing and Querying XML Data for Regular Path Expressions. VLDB, pages 361--370, 2001.
[16]
Liechti, Olivier and Sifer, Mark J. and Ichikawa, Tadao. Structured Graph Format: XML Metadata for Describing Web Site Structure. WWW, April 1998.
[17]
C. C. Low, B. C. Ooi, and H. Lu. H-trees: A Dynamic Associative Search Index for OODB. SIGMOD, pages 134--143, 1992.
[18]
Oracle. Oracle Business Rules. Business Whitepaper, 2005.
[19]
T. Sellis and C.-C. Lin. A Geometric Approach to Indexing of Large Rule Bases. Report No. UMIACS-TR-91-101, 1991.
[20]
Serge Abiteboul and Dallan Quass and Jason Mchugh and Jennifer Widom and Janet Wiener. The Lorel Query Language for Semistructured Data. International Journal on Digital Libraries, 1: 68--88, 1997.
[21]
D. Shin, H. Jang, and H. Jin. BUS: An Effective Indexing and Retrieval Scheme in Structured Documents. Proceedings of the Third ACM Conference on Digital Libraries, pages 235--243, 1998.
[22]
G. Varghese. Prefix-Match Lookups. Network Algorithmics, pages 233--266, 2005.

Cited By

View all
  • (2020)Making Search Engines Faster by Lowering the Cost of Querying Business Rules Through FPGAsProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3386133(2255-2270)Online publication date: 11-Jun-2020

Index Terms

  1. Indexing and selecting hierarchical business logic
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image Proceedings of the VLDB Endowment
      Proceedings of the VLDB Endowment  Volume 8, Issue 12
      Proceedings of the 41st International Conference on Very Large Data Bases, Kohala Coast, Hawaii
      August 2015
      728 pages
      ISSN:2150-8097
      • Editors:
      • Chen Li,
      • Volker Markl
      Issue’s Table of Contents

      Publisher

      VLDB Endowment

      Publication History

      Published: 01 August 2015
      Published in PVLDB Volume 8, Issue 12

      Qualifiers

      • Research-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)4
      • Downloads (Last 6 weeks)1
      Reflects downloads up to 14 Oct 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2020)Making Search Engines Faster by Lowering the Cost of Querying Business Rules Through FPGAsProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3386133(2255-2270)Online publication date: 11-Jun-2020

      View Options

      Get Access

      Login options

      Full Access

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media