Abstract
The minimization of cost is an important issue in the domain of continuous auditing (CA) research (Pathak, Chaouch & Sriram, 2005). This cited study of continuous audit of databases motivated us to work further and provide a general, complete and precise solution. In the present study, we propose an efficient algorithm as a general theory in terms of long term cost for counting and periodic strategies of continuous auditing as suggested by Pathak et al. study. Another novel feature of this paper is that we do not assume independence of validation time process. We have also offered analytical and computational results for practitioners and the professionals of database audit for practical implementation of our algorithms. The improved algorithms in the form of general theory contribute to accounting literature in general and continuous audit in particular in the form of general theory proposed for minimizing the cost of CA of databases. This study also makes significant contribution to the enterprise policy as cost minimization is an important component of policy studies in accounting area.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
