The Level-Cycle Merging Method

Counting method is an efficient algorithm in the processing of linear recursive queries in acyclic databases. Level-Cycle Merging (LCM) method is an extension of the counting method to process linear recursive queries in both cyclic and acyclic databases. The method precompiles databases to extract self level-cycle information, uses level-cycle sets to register level recurrence sequences in both up-chain and down-chain processing, and extracts answers by level matching analysis. To improve performance, golden cycle optimization is also proposed. Our analysis shows that the method has the same asymptotic running time as the counting method and a reasonable cost on EDB compilation and updates. Our study shows that Level-Cycle Merging compares favorably with other recently developed cyclic counting techniques.