|
Article information
2007 , Volume 12, ¹ 2, p.23-32
Afonin S.A.
Efficient algorithms for processing of conjunctive regular path queries
A problem of the processing of conjunctive regular path queries over semistructured databases (an NP complete problem) is considered. A number of heuristics for conjunctive query processing are introduced and an algorithm for query evaluation plan construction is proposed. Experimental results show the efficiency of the heuristics and corresponding query evaluation plans.
[full text] Author(s):
Afonin S.A.
Position: Senior Research Scientist
Address: Russia, Moscow
Phone Office: (495) 939 53 06
E-mail: serg@msu.ru
Bibliography link:
Afonin S.A. Efficient algorithms for processing of conjunctive regular path queries // Computational technologies. 2007. V. 12. ¹ 2. P. 23-32
|
|
|
|
