Search experiment of business-rule by dynamic constraint algebra

Rui Kimura*, Takayuki Shiga, Mizuho Iwaihara

*Corresponding author for this work

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

Abstract

Although e-commerce is becoming popular, product rules, which describe various conditions such as prices, applicability, and discount conditions are still expressed in natural languages. These rules are difficult to deal with in relational databases because logics are separated from data. There is no system to search on multiple rules, so buyers have to check business rules one by one. In this paper, we take the case of airline tickets, hotel bookings and others as an example, and describe them in dynamic constraint conditions. We also show several queries written in Dynamic Constraint Algebra (DCA), and the result of the Dynamic Constraint Algebra Query Processing Engine can be utilized to present buyers available options, and to check how variables affect prices.

Original languageEnglish
Title of host publicationProceedings - International Workshop on Biomedical Data Engineering, BMDE2005
PublisherIEEE Computer Society
Pages1272-1275
Number of pages4
ISBN (Print)0769526578, 9780769526577
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event21st International Conference on Data Engineering Workshops 2005 - Tokyo, Japan
Duration: 2005 Apr 32005 Apr 4

Publication series

NameProceedings - International Workshop on Biomedical Data Engineering, BMDE2005
Volume2005

Conference

Conference21st International Conference on Data Engineering Workshops 2005
Country/TerritoryJapan
CityTokyo
Period05/4/305/4/4

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint

Dive into the research topics of 'Search experiment of business-rule by dynamic constraint algebra'. Together they form a unique fingerprint.

Cite this