Erscheinungsdatum: 07.02.2019, Medium: Buch, Einband: Gebunden, Titel: Scalable Processing of Spatial-Keyword Queries, Autor: Mahmood, Ahmed R. // Aref, Walid G., Redaktion: Jagadish, H. V., Verlag: Morgan & Claypool Publishers, Sprache: Englisch, Schlagworte: COMPUTERS // Data Processing, Rubrik: Informatik, Seiten: 118, Informationen: HC gerader Rücken kaschiert, Gewicht: 432 gr, Verkäufer: averdo
Erscheinungsdatum: 05/2010, Medium: Taschenbuch, Einband: Kartoniert / Broschiert, Titel: Efficient Approaches for Querying XML Data, Titelzusatz: Keyword-Based, Personalized, and Distributed Queries, Autor: Taha, Kamal, Verlag: LAP Lambert Acad. Publ., Sprache: Englisch, Rubrik: Informatik // EDV, Sonstiges, Seiten: 160, Informationen: Paperback, Gewicht: 255 gr, Verkäufer: averdo
Efficient Approaches for Querying XML Data ab 58.99 € als Taschenbuch: Keyword-Based Personalized and Distributed Queries. Aus dem Bereich: Bücher, English, International, Gebundene Ausgaben,
In this book, I have developed a keyword based multilingual restricted domain question answering system with dialogue management for Railway information in Bengali and Telugu. The system accepts typed text inputs and provides text output as well. The architecture of a multilingual restricted domain question answering system with dialogue management has been proposed. The system maintains language specific domain and linguistic models. The system maintains dialogue history for each query topic and for each language containing values of information chunks and the answers for the previous queries in the dialogue. The answer generation process retrieves data from the database and fills slots in the answer templates specific to query topic and language. Null answers are explained and recommendations are made suggesting alternative answers. The system has been developed in the Indian Railways information domain for accepting Telugu and Bengali text inputs and has been evaluated.
Since its first edition in 2003, the XML Database Symposium series (XSym) has been a forum for academics, practitioners, users and vendors, allowing all to discuss the use of and synergy between database management systems and XML. The previous symposia have provided opportunities for timely discussions on a broad range of topics pertaining to the theory and practice of XML data management and its applications. XSym 2009 continued this XSym tradition with a program consisting of 15 papers and a keynote shared with the 12th International Symposium on Database Programming Languages (DBPL 2009). We received 26 paper submissions, out of which eight papers were accepted as full papers, and seven as short/demo papers. Each submitted paper underwent a rigorous and careful review by four referees for long papers and three for the short ones. The contributions in these proceedings are a fine sample of the very best current - search in XML query processing, including full text, keyword and loosely structured queries, stream querying and joins, and materialized views. Among new theoretical advances we included work on a lambda-calculus model of XML and XPath, on m- ping from the enhanced entity-relationship conceptual model to the W3C XML Schema Language, on transactions, and extensions to XPath. Finally, work on data parallel algorithms, compression, and practical aspects of XQuery, including query forms and the use of Prolog are also part of this volume.
Graph-structured databases are widely prevalent, and the problem of effective search and retrieval from such graphs has been receiving much attention recently. For example, the Web can be naturally viewed as a graph. Likewise, a relational database can be viewed as a graph where tuples are modeled as vertices connected via foreign-key relationships, and a XML database can be represented as a graph with XML elements as nodes and containment or ID-IDREF edges as hyperlinks. Keyword search querying has emerged as one of the most effective paradigms for information discovery, especially over HTML documents in the World Wide Web. One of the key advantages of keyword search querying is its simplicity - users do not have to learn a complex query language, and can issue queries without any prior knowledge about the structure of the underlying data. Since the keyword search query interface is very flexible, queries may not always be precise and can potentially return a large number of query results, especially in large document collections. Consequently, an important requirement for keyword search is to rank the query result. The goal of this book is to present various search techniques.