Regresar

Answering top K queries efficiently with overlap in sources and source paths

Abstract:

Challenges in answering queries over Web-accessible sources are selecting the sources that must be accessed and computing answers efficiently. Both tasks become more difficult when there is overlap among sources and when sources may return answers of varying quality. The objective is to obtain the best answers while minimizing the costs or delay in computing these answers and is similar to solving a Top K problem efficiently. We motivate these problems and discuss solution approaches. Copyright © 2007, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Año de publicación:

2007

Keywords:

    Fuente:

    scopusscopus

    Tipo de documento:

    Conference Object

    Estado:

    Acceso restringido

    Áreas de conocimiento:

    • Base de datos
    • Ciencias de la computación
    • Ciencias de la computación

    Áreas temáticas:

    • Programación informática, programas, datos, seguridad

    Contribuidores:

    Rashid L.Rashid L.
    Naumann F.Naumann F.
    Wu Y.Wu Y.
    María-Esther VidalMaría-Esther Vidal
    Bleiholder J.Bleiholder J.