![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Query Processing We describe for the first time in the literature the application of Cooperative Query Answering techniques to semistructured data. In particular, we develop methods to deal with partial matching of path expressions when querying data in a graph-based model. We identify different types of mismatch and offer heuristics to handle them. We also describe a preliminary implementation. ![]() DiSC'03 © 2003 Association for Computing Machinery |