Keyword Search in Databases PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Keyword Search in Databases PDF full book. Access full book title Keyword Search in Databases by Jeffrey Xu Yu. Download full books in PDF and EPUB format.
Author: Jeffrey Xu Yu
Publisher: Springer Nature
ISBN: 3031794265
Category : Technology & Engineering
Languages : en
Pages : 143
Get Book Here
Book Description
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-structured XML database. 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. Table of Contents: Introduction / Schema-Based Keyword Search on Relational Databases / Graph-Based Keyword Search / Keyword Search in XML Databases / Other Topics for Keyword Search on Databases
Author: Jeffrey Xu Yu
Publisher: Springer Nature
ISBN: 3031794265
Category : Technology & Engineering
Languages : en
Pages : 143
Get Book Here
Book Description
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-structured XML database. 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. Table of Contents: Introduction / Schema-Based Keyword Search on Relational Databases / Graph-Based Keyword Search / Keyword Search in XML Databases / Other Topics for Keyword Search on Databases
Author: Randall MacDonald
Publisher: Greenwood
ISBN: 0313306761
Category : Education
Languages : en
Pages : 0
Get Book Here
Book Description
Students are using electronic resources more than ever before to locate information for assignments. Without the proper search terms, results are incomplete, and students are frustrated. Using the keywords, key people, organizations, and web sites provided in this book, compiled from the most commonly used databases, students will be able to perform successful searches for 144 of the most popular research topics, on their own or in the classroom. The 144 topics are divided into nine broad subject areas: Arts and Literature; Business, Communication, and Economics; Culture and Cultural Diversity; Health and Wellness; History, Political Science and Law; Philosophy and Religion; Science and Technology; Social Issues and Sociology; and Sports and Recreational Interests. Each topic section provides an extended list of keywords to be used alone or in combination with other words in the section to perform Boolean searches. The selected lists of key people include activists, artists, entertainers, politicians, scientists, and other well-known personalities in each field. Organizations and web sites lead the student to even more resources, providing a solid overview of each topic for the beginning researcher, as well as increasing general on-line searching skills.
Author: VLDB
Publisher: Morgan Kaufmann
ISBN: 9781558608696
Category : Computers
Languages : en
Pages : 1050
Get Book Here
Book Description
Proceedings of the 28th Annual International Conference on Very Large Data Bases held in Hong Kong, China on August 20-23, 2002. Organized by the VLDB Endowment, VLDB is the premier international conference on database technology.
Author: Ian H. Witten
Publisher: Morgan Kaufmann
ISBN: 9781558605701
Category : Business & Economics
Languages : en
Pages : 572
Get Book Here
Book Description
"This book is the Bible for anyone who needs to manage large data collections. It's required reading for our search gurus at Infoseek. The authors have done an outstanding job of incorporating and describing the most significant new research in information retrieval over the past five years into this second edition." Steve Kirsch, Cofounder, Infoseek Corporation "The new edition of Witten, Moffat, and Bell not only has newer and better text search algorithms but much material on image analysis and joint image/text processing. If you care about search engines, you need this book: it is the only one with full details of how they work. The book is both detailed and enjoyable; the authors have combined elegant writing with top-grade programming." Michael Lesk, National Science Foundation "The coverage of compression, file organizations, and indexing techniques for full text and document management systems is unsurpassed. Students, researchers, and practitioners will all benefit from reading this book." Bruce Croft, Director, Center for Intelligent Information Retrieval at the University of Massachusetts In this fully updated second edition of the highly acclaimed Managing Gigabytes, authors Witten, Moffat, and Bell continue to provide unparalleled coverage of state-of-the-art techniques for compressing and indexing data. Whatever your field, if you work with large quantities of information, this book is essential reading--an authoritative theoretical resource and a practical guide to meeting the toughest storage and access challenges. It covers the latest developments in compression and indexing and their application on the Web and in digital libraries. It also details dozens of powerful techniques supported by mg, the authors' own system for compressing, storing, and retrieving text, images, and textual images. mg's source code is freely available on the Web.
Author: American Psychological Association
Publisher: Washington, D.C. : American Psychological Association
ISBN:
Category : Psychology
Languages : en
Pages : 282
Get Book Here
Book Description
Alphabetical listing of psychological terms derived from psychological literature. Present edition contains 4534 postable terms. Frequency of occurrence, potential usefulness, and overlap with existing thesaurus terms are criteria for inclusion. Entries give narrower and broader terms, as well as cross-references. Each postable term fits into 16 major categories and 64 subcategories. Also contains related alphabetical terms section.
Author: Randall M. MacDonald
Publisher: Greenwood International
ISBN: 9781567508451
Category : Language Arts & Disciplines
Languages : en
Pages : 464
Get Book Here
Book Description
Empowers students to search on-line successfully for 144 of the most popular research topics using the keywords, key people, organizations, and web sites found in this book.
Author: Mehdi Kargar
Publisher:
ISBN:
Category :
Languages : en
Pages :
Get Book Here
Book Description
Keyword search, a well known mechanism for retrieving relevant information from a set of documents, has recently been studied for extracting information from structured data (e.g., relational databases and XML documents). It offers an alternative way to query languages (e.g., SQL) to explore databases, which is effective for lay users who may not be familiar with the database schema or the query language. This dissertation addresses some issues in keyword search in structured data. Namely, novel solutions to existing problems in keyword search in graphs or relational databases are proposed. In addition, a problem related to graph keyword search, team formation in social networks, is studied. The dissertation consists of four parts. The first part addresses keyword search over a graph which finds a substructure of the graph containing all or some of the query keywords. Current methods for keyword search over graphs may produce answers in which some content nodes (id est, nodes that contain input keywords) are not very close to each other. In addition, current methods explore both content and non-content nodes while searching for the result and are thus both time and memory consuming for large graphs. To address the above problems, we propose algorithms for finding r-cliques in graphs. An r-clique is a group of content nodes that cover all the input keywords and the distance between each pair of nodes is less than or equal to r. Two approximation algorithms that produce r-cliques with a bounded approximation ratio in polynomial delay are proposed. In the second part, the problem of duplication-free and minimal keyword search in graphs is studied. Current methods for keyword search in graphs may produce duplicate answers that contain the same set of content nodes. In addition, an answer found by these methods may not be minimal in the sense that some of the nodes in the answer may contain query keywords that are all covered by other nodes in the answer. Removing these nodes does not change the coverage of the answer but can make the answer more compact. We define the problem of finding duplication-free and minimal answers, and propose algorithms for finding such answers efficiently. Meaningful keyword search in relational databases is the subject of the third part of this dissertation. Keyword search over relational databases returns a join tree spanning tuples containing the query keywords. As many answers of varying quality can be found, and the user is often only interested in seeing the top-k answers, how to gauge the relevance of answers to rank them is of paramount importance. This becomes more pertinent for databases with large and complex schemas. We focus on the relevance of join trees as the fundamental means to rank the answers. We devise means to measure relevance of relations and foreign keys in the schema over the information content of the database. The problem of keyword search over graph data is similar to the problem of team formation in social networks. In this setting, keywords represent skills and the nodes in a graph represent the experts that possess skills. Given an expert network, in which a node represents an expert that has a cost for using the expert service and an edge represents the communication cost between the two corresponding experts, we tackle the problem of finding a team of experts that covers a set of required skills and also minimizes the communication cost as well as the personnel cost of the team. We propose two types of approximation algorithms to solve this bi-criteria problem in the fourth part of this dissertation.
Author: Sven Hartmann
Publisher: Springer
ISBN: 3319444034
Category : Computers
Languages : en
Pages : 461
Get Book Here
Book Description
This two volume set LNCS 9827 and LNCS 9828 constitutes the refereed proceedings of the 27th International Conference on Database and Expert Systems Applications, DEXA 2016, held in Porto, Portugal, September 2016. The 39 revised full papers presented together with 29 short papers were carefully reviewed and selected from 137 submissions. The papers discuss a range of topics including: Temporal, Spatial, and High Dimensional Databases; Data Mining; Authenticity, Privacy, Security, and Trust; Data Clustering; Distributed and Big Data Processing; Decision Support Systems, and Learning; Data Streams; Data Integration, and Interoperability; Semantic Web, and Data Semantics; Social Networks, and Network Analysis; Linked Data; Data Analysis; NoSQL, NewSQL; Multimedia Data; Personal Information Management; Semantic Web and Ontologies; Database and Information System Architectures; Query Answering and Optimization; Information Retrieval, and Keyword Search; Data Modelling, and Uncertainty.
Author: Ramamohanarao Kotagiri
Publisher: Springer
ISBN: 354071703X
Category : Computers
Languages : en
Pages : 1143
Get Book Here
Book Description
This book constitutes the refereed proceedings of the 12th International Conference on Database Systems for Advanced Applications, DASFAA 2007, held in Bangkok, Thailand, April 2007. Coverage includes query language and query optimization, data mining and knowledge discovery, P2P and grid-based data management, XML databases, database modeling and information retrieval, Web and information retrieval, database applications and security.
Author: Barbara Catania
Publisher: Springer
ISBN: 3642406831
Category : Computers
Languages : en
Pages : 415
Get Book Here
Book Description
This book constitutes the thoroughly refereed proceedings of the 17th East-European Conference on Advances in Databases and Information Systems, ADBIS 2013, held in Genoa, Italy, in September 2013. The 26 revised full papers presented together with three invited papers were carefully selected and reviewed from 92 submissions. The papers are organized in topical sections on ontologies; indexing; data mining; OLAP; XML data processing; querying; similarity search; GPU; querying in parallel architectures; performance evaluation; distributed architectures.