BIROn - Birkbeck Institutional Research Online

    Finding Top-k approximate answers to path queries

    Hurtado, C.A. and Poulovassilis, Alexandra and Wood, Peter T. (2009) Finding Top-k approximate answers to path queries. In: Andreasen, T. and Yager, R.R. and Bulskov, H. and Christiansen, H. and Larsen, H.L. (eds.) Flexible Query Answering Systems. Lecture Notes In Computer Science 5822. Berlin, Germany: Springer, pp. 465-476. ISBN 9783642049569.

    Full text not available from this repository.

    Abstract

    We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of regular path queries, allowing path variables to appear in the bodies and the heads of rules, so that paths can be returned to the user. We propose an approximate query matching semantics which adapts standard notions of approximation from string matching to graph matching. Query results are returned to the user ranked in order of increasing “distance” to the user’s original query. We show that the top-k approximate answers can be returned in polynomial time in the size of the database graph and the query.

    Metadata

    Item Type: Book Section
    Additional Information: 8th International Conference, FQAS 2009, Roskilde, Denmark, October 26-28, 2009. Proceedings
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Research Centre: Innovation Management Research, Birkbeck Centre for, Bioinformatics, Bloomsbury Centre for, Birkbeck Knowledge Lab
    Depositing User: Administrator
    Date Deposited: 11 Jun 2013 13:26
    Last Modified: 12 Dec 2016 13:56
    URI: http://eprints.bbk.ac.uk/id/eprint/7449

    Statistics

    Downloads
    Activity Overview
    0Downloads
    161Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item