Abstract
Query reformulation is a key issue of the data integration,and it automatically rewrites the user's query request to the data source request directly.Recently the University of Michigan and the IBM AImaden Research Center presented a novel algorithm for constraint-based XML query reformulation,but it did not consider the problem of complex schema matching and limited the algorithm application.Based on the original query reformulation algorithm,an extended algorithm for XML query reformulation was presented,expanding the application scope of the original algorithm.The correctness and time complexity of the extended algorithm were also given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
