loading...
Search Experiment of Business-Rule by Dynamic Constraint Algebra
Tokyo, Japan April 05-April 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2005.27821st International Conference on Data ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Rui KIMURA, School of Informatics and Mathematical Science, Faculty of Engineering, Kyoto University
Takayuki SHIGA, Department of Social Informatics Graduate School of Informatics, Kyoto University
Mizuho IWAIHARA, Department of Social Informatics Graduate School of Informatics, Kyoto University
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.
Citation:
Rui KIMURA, Takayuki SHIGA, Mizuho IWAIHARA, "Search Experiment of Business-Rule by Dynamic Constraint Algebra," icdew, pp.1272, 21st International Conference on Data Engineering Workshops (ICDEW'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions