Keyword Search in Databases

Synthesis lectures on data management

Book 1
Morgan & Claypool Publishers
Free sample

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
Read more
Loading...

Additional Information

Publisher
Morgan & Claypool Publishers
Read more
Published on
Dec 31, 2010
Read more
Pages
143
Read more
ISBN
9781608451951
Read more
Read more
Best For
Read more
Language
English
Read more
Genres
Computers / Social Aspects / Human-Computer Interaction
Read more
Content Protection
This content is DRM protected.
Read more

Reading information

Smartphones and Tablets

Install the Google Play Books app for Android and iPad/iPhone. It syncs automatically with your account and allows you to read online or offline wherever you are.

Laptops and Computers

You can read books purchased on Google Play using your computer's web browser.

eReaders and other devices

To read on e-ink devices like the Sony eReader or Barnes & Noble Nook, you'll need to download a file and transfer it to your device. Please follow the detailed Help center instructions to transfer the files to supported eReaders.
Access control is one of the fundamental services that any Data Management System should provide. Its main goal is to protect data from unauthorized read and write operations. This is particularly crucial in today's open and interconnected world, where each kind of information can be easily made available to a huge user population, and where a damage or misuse of data may have unpredictable consequences that go beyond the boundaries where data reside or have been generated. This book provides an overview of the various developments in access control for data management systems. Discretionary, mandatory, and role-based access control will be discussed, by surveying the most relevant proposals and analyzing the benefits and drawbacks of each paradigm in view of the requirements of different application domains. Access control mechanisms provided by commercial Data Management Systems are presented and discussed. Finally, the last part of the book is devoted to discussion of some of the most challenging and innovative research trends in the area of access control, such as those related to the Web 2.0 revolution or to the Database as a Service paradigm. This book is a valuable reference for an heterogeneous audience. It can be used as either an extended survey for people who are interested in access control or as a reference book for senior undergraduate or graduate courses in data security with a special focus on access control. It is also useful for technologists, researchers, managers, and developers who want to know more about access control and related emerging trends. Table of Contents: List of Figures / The Atomic Register Abstraction / Implementing an Atomic Register in a Crash-Prone Asynchronous System / The Uniform Reliable Broadcast Abstraction / Uniform Reliable Broadcast Abstraction Despite Unreliable Channels / The Consensus Abstraction / Consensus Algorithms for Asynchronous Systems Enriched with Various Failure Detectors / Constructing Failure Detectors
Welcome to the tenth anniversary of the International Conference on Web Information Systems Engineering, WISE 2009. This year the WISE conference continued the tradition that has evolved from the inaugural conference held in 2000 in Hong Kong and since then has made its journey around the world: 2001 Kyoto (Japan), 2002 Singapore, 2003 Rome (Italy), 2004 Brisbane (Australia), 2005 New York (USA), 2006 Wuhan (China), 2007 Nancy (France), and 2008 Auckland (New Zealand). This year we were happy to hold the event in Poznan, a city of 600,000 inhabitants in western Poland. Poznan is the capital of the most affluent province of the country – Wielkopolska – which means “Greater Poland”. For more than 1,000 years, Poznan’s geographical location has predestined the city to be a significant scientific, cultural and economic center with more than just regional influence. The city is situated on the strategic cross-roads from Paris and Berlin in the west, to Warsaw and Moscow in the east, and from Scandinavia through the Baltic Sea in the north to the Balkans in the south. Poznan is a great research and university center with a dynamic potential. In all, 140,000 students are enrolled in 26 state-run and private institutions of higher education here, among which the Poznan University of Economics with its 12,000 students is one of the biggest. The WISE 2009 Conference provided a forum for engineers and scientists to present their latest findings in Web-related technologies and solutions.
The14thPaci?c-AsiaConferenceonKnowledgeDiscoveryandData Mining was held in Hyderabad, India during June 21–24, 2010; this was the ?rst time the conference was held in India. PAKDDisamajorinternationalconferenceintheareasofdatamining (DM) and knowledge discovery in databases (KDD). It provides an international - rum for researchers and industry practitioners to share their new ideas, original research results and practical development experiences from all KDD-related areas including data mining, data warehousing, machine learning, databases, statistics, knowledge acquisition and automatic scienti?c discovery, data visu- ization, causal induction and knowledge-based systems. PAKDD-2010 received 412 research papers from over 34 countries incl- ing: Australia, Austria, Belgium, Canada, China, Cuba, Egypt, Finland, France, Germany, Greece, Hong Kong, India, Iran, Italy, Japan, S. Korea, Malaysia, Mexico, TheNetherlands, NewCaledonia, NewZealand, SanMarino, Singapore, Slovenia, Spain, Switzerland, Taiwan, Thailand, Tunisia, Turkey, UK, USA, and Vietnam. This clearly re?ects the truly international stature of the PAKDD conference. AfteraninitialscreeningofthepapersbytheProgramCommitteeChairs, for papers that did not conform to the submission guidelines or that were deemed not worthy of further reviews, 60 papers were rejected with a brief expla- tion for the decision. The remaining 352 papers were rigorously reviewed by at least three reviewers. The initial results were discussed among the reviewers and ?nally judged by the Program Committee Chairs. In some cases of c- ?ict additional reviews were sought. As a result of the deliberation process, only 42 papers (10.2%) were accepted as long presentations (25 mins), and an ad- tional 55 papers (13.3%) were accepted as short presentations (15 mins). The total acceptance rate was thus about 23.5% across both categories.
The14thPaci?c-AsiaConferenceonKnowledgeDiscoveryandData Mining was held in Hyderabad, India during June 21–24, 2010; this was the ?rst time the conference was held in India. PAKDDisamajorinternationalconferenceintheareasofdatamining (DM) and knowledge discovery in databases (KDD). It provides an international - rum for researchers and industry practitioners to share their new ideas, original research results and practical development experiences from all KDD-related areas including data mining, data warehousing, machine learning, databases, statistics, knowledge acquisition and automatic scienti?c discovery, data visu- ization, causal induction and knowledge-based systems. PAKDD-2010 received 412 research papers from over 34 countries incl- ing: Australia, Austria, Belgium, Canada, China, Cuba, Egypt, Finland, France, Germany, Greece, Hong Kong, India, Iran, Italy, Japan, S. Korea, Malaysia, Mexico, TheNetherlands, NewCaledonia, NewZealand, SanMarino, Singapore, Slovenia, Spain, Switzerland, Taiwan, Thailand, Tunisia, Turkey, UK, USA, and Vietnam. This clearly re?ects the truly international stature of the PAKDD conference. AfteraninitialscreeningofthepapersbytheProgramCommitteeChairs, for papers that did not conform to the submission guidelines or that were deemed not worthy of further reviews, 60 papers were rejected with a brief expla- tion for the decision. The remaining 352 papers were rigorously reviewed by at least three reviewers. The initial results were discussed among the reviewers and ?nally judged by the Program Committee Chairs. In some cases of c- ?ict additional reviews were sought. As a result of the deliberation process, only 42 papers (10.2%) were accepted as long presentations (25 mins), and an ad- tional 55 papers (13.3%) were accepted as short presentations (15 mins). The total acceptance rate was thus about 23.5% across both categories.
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
©2018 GoogleSite Terms of ServicePrivacyDevelopersArtistsAbout Google|Location: United StatesLanguage: English (United States)
By purchasing this item, you are transacting with Google Payments and agreeing to the Google Payments Terms of Service and Privacy Notice.