Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

Keyword search in databases

By: Yu, Jeffrey Xu.
Contributor(s): Lu, Qin | Chang, Lijun.
Material type: materialTypeLabelBookSeries: Synthesis lectures on data management: # 1.Publisher: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool Publishers, c2010Description: 1 electronic text (xii, 143 p. : ill.) : digital file.ISBN: 9781608451968 (electronic bk.).Uniform titles: Synthesis digital library of engineering and computer science. Subject(s): Keyword searching | Database searchingDDC classification: 025.04 Online resources: Abstract with links to resource | Abstract with links to full text Also available in print.
Contents:
Preface -- 1. Introduction -- 2. Schema-based keyword search on relational databases: 2.1. Introduction; 2.2. Candidate network generation; 2.3. Candidate network evaluation; 2.4. Other keyword search semantics -- 3. Graph-based keyword search: 3.1. Graph model and problem definition; 3.2. Polynomial delay and Dijkstra’s algorithm; 3.3. Steiner tree-based keyword search; 3.4. Distinct root-based keyword search; 3.5. Subgraph-based keyword search -- 4. Keyword search in XML databases: 4.1. XML and problem definition; 4.2. SLCA-based semantics; 4.3. Identify meaningful return information; 4.4. ELCA-based semantics; 4.5. Other approaches -- 5. Other topics for keyword search on databases: 5.1. Keyword search across databases; 5.2. Keyword search on spatial databases; 5.3. Variations of keyword search on databases -- Bibliography -- Authors' biographies.
Abstract: It has become highly desirable to provide users with flexible ways to query/search information over databases as simple as keyword search like Google search. This book surveys the recent developments on keyword search over databases, and focuses on finding structural information among objects in a database using a set of keywords. Such structural information to be returned can be either trees or subgraphs representing how the objects, that contain the required keywords, are interconnected in a relational database or in an XML database. The structural keyword search is completely different from finding documents that contain all the user-given keywords. The former focuses on the interconnected object structures, whereas the latter focuses on the object content.Summary: The book is organized as follows. In Chapter 1, we highlight the main research issues on the structural keyword search in different contexts. In Chapter 2, we focus on supporting structural keyword search in a relational database management system using the SQL query language. We concentrate on how to generate a set of SQL queries that can find all the structural information among records in a relational database completely, and how to evaluate the generated set of SQL queries efficiently. In Chapter 3,we discuss graph algorithms for structural keyword search by treating an entire relational database as a large data graph. In Chapter 4, we discuss structural keyword search in a large tree-structuredXMLdatabase. In Chapter 5,we highlight several interesting research issues regarding keyword search on databases. The book can be used as either an extended survey for people who are interested in the structural keyword search or a reference book for a postgraduate course on the related topics.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
E books E books PK Kelkar Library, IIT Kanpur
Available EBKE226
Total holds: 0

Mode of access: World Wide Web.

System requirements: Adobe Acrobat reader.

Part of: Synthesis digital library of engineering and computer science.

Series from website.

Includes bibliographical references (133-141).

Preface -- 1. Introduction -- 2. Schema-based keyword search on relational databases: 2.1. Introduction; 2.2. Candidate network generation; 2.3. Candidate network evaluation; 2.4. Other keyword search semantics -- 3. Graph-based keyword search: 3.1. Graph model and problem definition; 3.2. Polynomial delay and Dijkstra’s algorithm; 3.3. Steiner tree-based keyword search; 3.4. Distinct root-based keyword search; 3.5. Subgraph-based keyword search -- 4. Keyword search in XML databases: 4.1. XML and problem definition; 4.2. SLCA-based semantics; 4.3. Identify meaningful return information; 4.4. ELCA-based semantics; 4.5. Other approaches -- 5. Other topics for keyword search on databases: 5.1. Keyword search across databases; 5.2. Keyword search on spatial databases; 5.3. Variations of keyword search on databases -- Bibliography -- Authors' biographies.

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Compendex

INSPEC

Google scholar

Google book search

It has become highly desirable to provide users with flexible ways to query/search information over databases as simple as keyword search like Google search. This book surveys the recent developments on keyword search over databases, and focuses on finding structural information among objects in a database using a set of keywords. Such structural information to be returned can be either trees or subgraphs representing how the objects, that contain the required keywords, are interconnected in a relational database or in an XML database. The structural keyword search is completely different from finding documents that contain all the user-given keywords. The former focuses on the interconnected object structures, whereas the latter focuses on the object content.

The book is organized as follows. In Chapter 1, we highlight the main research issues on the structural keyword search in different contexts. In Chapter 2, we focus on supporting structural keyword search in a relational database management system using the SQL query language. We concentrate on how to generate a set of SQL queries that can find all the structural information among records in a relational database completely, and how to evaluate the generated set of SQL queries efficiently. In Chapter 3,we discuss graph algorithms for structural keyword search by treating an entire relational database as a large data graph. In Chapter 4, we discuss structural keyword search in a large tree-structuredXMLdatabase. In Chapter 5,we highlight several interesting research issues regarding keyword search on databases. The book can be used as either an extended survey for people who are interested in the structural keyword search or a reference book for a postgraduate course on the related topics.

Also available in print.

Title from PDF t.p. (viewed on January 11, 2010).

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha