DOCSLIB.ORG

Index Strategies for Efficient and Effective Entity Search

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Index Strategies for Efficient and Effective Entity Search San Jose State University SJSU ScholarWorks Master's Projects Master's Theses and Graduate Research Spring 5-21-2015 INDEX STRATEGIES FOR EFFICIENT AND EFFECTIVE ENTITY SEARCH Huy T. Vu San Jose State University Follow this and additional works at: https://scholarworks.sjsu.edu/etd_projects Part of the Databases and Information Systems Commons, and the Systems Architecture Commons Recommended Citation Vu, Huy T., "INDEX STRATEGIES FOR EFFICIENT AND EFFECTIVE ENTITY SEARCH" (2015). Master's Projects. 396. DOI: https://doi.org/10.31979/etd.t8kz-y8gn https://scholarworks.sjsu.edu/etd_projects/396 This Master's Project is brought to you for free and open access by the Master's Theses and Graduate Research at SJSU ScholarWorks. It has been accepted for inclusion in Master's Projects by an authorized administrator of SJSU ScholarWorks. For more information, please contact [email protected]. INDEX STRATEGIES FOR EFFICIENT AND EFFECTIVE ENTITY SEARCH A Thesis Presented to The Faculty of the Department of Computer Science San José State University In Partial Fulfillment of the Requirement of the Degree Master of Science by Huy T. Vu May 2015 The Designated Thesis Committee Approves the Thesis Titled © 2015 Huy T. Vu ALL RIGHTS RESERVED INDEX STRATEGIES FOR EFFICIENT AND EFFECTIVE ENTITY SEARCH by Huy T. Vu APPROVED FOR THE DEPARTMENT OF COMPUTER SCIENCE SAN JOSÉ STATE UNIVERSITY May 2015 ______________________________________________ Dr. Thanh Tran Department of Computer Science ______________________________________________ Dr. Tsau-Young Lin Department of Computer Science ______________________________________________ Dr. Chris Tseng Department of Computer Science ABSTRACT The volume of structured data has rapidly grown in recent years, when data-entity emerged as an abstraction that captures almost every data pieces. As a result, searching for a desired piece of information on the web could be a challenge in term of time and relevancy because the number of matching entities could be very large for a given query. This project concerns with the efficiency and effectiveness of such entity queries. The work contains two major parts: implement inverted indexing strategies so that queries can be searched in minimal time, and rank results based on features that are independent of the query itself. ACKNOWLEDGEMENTS I would like to thank my family for their great support throughout my study at San Jose State University I would like to express my gratitude to Dr. Thanh Tran, my thesis advisor, for his supports and motivations in the completion of this project I would like to thank my project committee member, Dr. Tsau-Young Lin and Dr. Chris Tseng, for their contribution in the completion of this project Table of Contents 1. Introduction ................................................................................................................ 5 2. Related Works ........................................................................................................... 7 2.1. Inverted Indexing ................................................................................................. 7 2.1.1. Vertical Indexing ........................................................................................ 8 2.1.2. Horizontal Indexing .................................................................................... 9 2.1.3. Reduced Indexing .................................................................................... 10 2.2. Learning To Rank .............................................................................................. 11 2.2.1. TF-IDF ..................................................................................................... 11 2.2.2. Okapi BM25 ............................................................................................. 13 2.2.3. BM25F & Variants .................................................................................... 14 2.3. Query-Independent Features ............................................................................ 14 3. Project Design.......................................................................................................... 15 3.1. Definition ........................................................................................................... 15 3.1.1. Problem Formulation................................................................................ 15 3.1.2. Terminology ............................................................................................. 15 3.2. Technology ........................................................................................................ 18 3.2.1. Apache Lucene ........................................................................................ 18 3.2.2. Solr & Java API ........................................................................................ 19 3.3. Query Efficiencies.............................................................................................. 19 3.4. Query Effectiveness .......................................................................................... 20 3.4.1. Simple Relevancy Score ......................................................................... 20 3.4.2. Independent Features .............................................................................. 21 4. Implementation ........................................................................................................ 22 4.1. Solr Server Setup .............................................................................................. 22 4.1.1. Schema .................................................................................................... 22 4.1.2. Configuration ........................................................................................... 23 4.2. Index Time Implementation ............................................................................... 23 4.2.1. Indexer ..................................................................................................... 24 4.2.2. Analyzer ................................................................................................... 24 4.2.3. Payload Filter ........................................................................................... 25 4.3. Search Time Implementation ............................................................................. 26 4.3.1. Search Handler ........................................................................................ 27 4.3.2. Scorer ...................................................................................................... 27 4.3.3. Timer........................................................................................................ 28 4.3.4. Result Formatter ...................................................................................... 28 5. Performance ............................................................................................................ 29 5.1. Query Types ...................................................................................................... 29 5.1.1. Default Term Query ................................................................................. 29 5.1.2. Term Query Over Single Field ................................................................. 29 5.1.3. Query Over Multiple Fields ...................................................................... 30 5.2. Medicare Healthful Contacts Dataset ................................................................ 30 1 5.2.1. Examination of Ten Queries .................................................................... 31 5.2.2. Experiment in Depth ................................................................................ 33 5.3. International Aiding Dataset .............................................................................. 35 5.3.1. Examination of Ten Queries .................................................................... 36 5.3.2. Experiment in Depth ................................................................................ 38 5.4. Discussion ......................................................................................................... 39 5.5. Reduced Indexing Factor .................................................................................. 40 6. Conclusion ............................................................................................................... 44 References .............................................................................................................. 45 2 List of Figures Figure 1: Growth of data, projection into year 2020 ........................................................ 5 Figure 2: Illustration of inverted index.............................................................................. 7 Figure 3: A sample entity object represented as document in Lucene ............................ 8 Figure 4: Lucene architecture and flow diagram ........................................................... 18 Figure 5: Solr architecture ............................................................................................. 19 Figure 6: A typical design of Solr schema ..................................................................... 22 Figure 7: Configuration of one request handler ............................................................. 23 Figure 8: Separate storage location for indexer ............................................................ 24 Figure 9: Example of payloads in inverted index ..........................................................
Load more

Recommended publications
  • Automatic Indexing: an Approach Using an Index Term Corpus and Combining Linguistic and Statistical Methods
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Helsingin yliopiston digitaalinen arkisto Automatic indexing: an approach using an index term corpus and combining linguistic and statistical methods Timo Lahtinen Academic dissertation to be publicly discussed, by due permission of the Faculty of Arts at the University of Helsinki in lecture room Unioninkatu 35, on the 11th of December, 2000, at 11 o’clock. University of Helsinki PUBLICATIONS Department of General Linguistics NO. 34 P.O. Box 4 2000 FIN-00014 University of Helsinki Finland ISBN 951-45-9639-0 ISBN 951-45-9640-4 (PDF) ISSN 0355-7170 Helsinki 2000 Yliopistopaino Abstract This thesis discusses the problems and the methods of finding relevant information in large collections of documents. The contribution of this thesis to this problem is to develop better content analysis methods which can be used to describe document content with index terms. Index terms can be used as meta-information that describes documents, and that is used for seeking information. The main point of this thesis is to illustrate the process of developing an automatic indexer which analyses the content of documents by combining evidence from word frequencies and evidence from linguistic analysis provided by a syntactic parser. The indexer weights the expressions of a text according to their estimated importance for describing the content of a given document on the basis of the content analysis. The typical linguistic features of index terms were explored using a linguistically analysed text collection where the index terms are manually marked up. This text collection is referred to as an index term corpus.
    [Show full text]
  • NEDLIB Glossary
    NEDLIB Glossary Authors: José Luis Borbinha, National Library of Portugal Fernando Cardoso, National Library of Portugal Nuno Freire, INESC Date of Issue: 22 February 2000 Issue: 1.0web Total Number of Pages: 46 NEDLIB Glossary TABLE OF CONTENTS TABLE OF CONTENTS...............................................................................................................................................................................i Abstract ................................................................................................................................................................................................2 Keywords..............................................................................................................................................................................................2 1. Concepts ..................................................................................................................................................................................................2 1.1 Index of Terms ............................................................................................................................................................................2 1.2 Terms Relationship ....................................................................................................................................................................6 1.3 Glossary ....................................................................................................................................................................................13
    [Show full text]
  • A Design of the Inverted Index Based on Web Document Comprehending
    664 JOURNAL OF COMPUTERS, VOL. 6, NO. 4, APRIL 2011 A Design of the Inverted Index Based on Web Document Comprehending Shaojun Zhong Jiangxi University of Science and Technology, Ganzhou, China Email:[email protected] Min Shang and Zhijuan Deng Yuxi Normal University, Yuxi, China Jiangxi University of Science and Technology, Ganzhou, China Email:[email protected], [email protected] Abstract—A design of inverted index based on web document comprehending is induced and the algorithm is II. INVERTED INDEX TECHNOLOGY presented by combining the inverted index and the web documents understanding technology. Experimental results The inverted index is the most widely used index show that less time is cost than the traditional inverted index model at present. All words in the documents are indexed to query in the documents with the same size. as key words in inverted index. The recording item of each word includes the document that contains the word, Index Terms—inverted index, Web document as well as its location in the document. Thus, when you comprehending, latent semantic analysis, correlation search a word in the index, you can easily find the document which contains the word and its location in the document. For inverted index of search engine, since the I. INTRODUCTION number of web pages related to lexical items is The emergence of the Internet makes major changes of dynamically changed, and so is the content of the web the information retrieval. Search engines have become a pages, it is more difficult to maintain the inverted index. convenient way to query data, access to information.
    [Show full text]
  • Three SGML Metadata Formats: TEI, EAD, and CIMI
    Three SGML metadata formats: TEI, EAD, and CIMI A Study for BIBLINK Work Package 1.1 December 1996 Lou Burnard and Richard Light BIBLINK study of SGML metadata formats Page 1 Prefatory Note BIBLINK Work Package 1 (Study of Metadata) is intended to identify, describe, and compare current approaches to the encoding of metadata, with a view to making recommendations. Amongst the many different approaches currently in use, those based on the Standard Generalized Markup Lamguage (SGML: ISO 8879) appear to offer the widest range of features and the broadest potential for cross-sector applicability. This additional detailed study on three SGML-based formats was therefore commissioned to supplement the survey reported on in Work Package 1. This report consists of a brief overview of each of the three schemes studied, some general discussion of the technical aspects of using SGML in a production environment, and a detailed feature by feature comparison of the three schemes with respect to a number of key attributes identified by the Biblink project. A bibliography with pointers to further reading on each of the three schemes is also provided. Richard Light was responsible for the original draft of the report, and for the information on CIMI and EAD. Lou Burnard was responsible for final editing of the report and for the information on TEI and SGML. Thanks are due to John Perkins, Daniel Pitti, and Rachel Heery for helpful suggestions during the preparation of the report. 1 Introduction 2 2 Overview of the schemes studied 2 2.1 The Text Encoding
    [Show full text]
  • Metadata Standards & Applications
    Cataloging for the 21st Century -- Course 2 Metadata Standards & Applications Trainee Manual Original course design by Diane I. Hillmann Cornell University Library Revised by Rebecca Guenther and Allene Hayes, Library of Congress For The Library of Congress And the Association for Library Collections & Technical Services Washington, DC August 2008 THIS PAGE INTENTIONALLY LEFT BLANK FOR DOUBLE SIDED COPY Trainee Manual Course Outline Metadata Standards and Applications Outline 1. Introduction to Digital Libraries and Metadata • Discuss similarities and differences between traditional and digital libraries • Understand how the environment where metadata is developing is different from the library automation environment • Explore different types and functions of metadata (administrative, technical, administrative, etc.) Exercise: Examine three digital library instances, discuss differences in user approach and experience, and look for examples of metadata use 2. Descriptive Metadata Standards • Understand the categories of descriptive metadata standards (e.g., data content standards, data value standards, data structure standards, relationship models) • Learn about the various descriptive metadata standards and the communities that use them • Evaluate the efficacy of a standard for a particular community • Understand how relationship models are used Exercise: Create a brief descriptive metadata record using the standard assigned. 3. Technical and Administrative Metadata Standards • Understand the different types of administrative metadata
    [Show full text]
  • Unit14 Overview of Web Indexing, Metadata, Interoperability and Ontologies
    UNIT14 OVERVIEW OF WEB INDEXING, METADATA, INTEROPERABILITY AND ONTOLOGIES Structure 14.0 Objectives 14.1 Introduction 14.2 Web Indexing 14.2.1 Concept 14.2.2 Types of Web Indexes 14.3 Metadata 14.3.1 Concept 14.3.2 Types 14.4 Ontology 14.4.1 Concept 14.4.2 Web Ontology 14.4.3 Types 14.5 Interoperability 14.5.1 Need 14.5.2 Interoperability and Web Search 14.5.3 Methods for Achieving Interoperability 14.5.4 Protocols for Interoperability 14.6 Summary 14.7 Answers to Self Check Exercises 14.8 Keywords 14.9 References and Further Reading 14.0 OBJECTIVES After reading this Unit, you will be able to: define the meaning and need of web indexing; explain the role, usage and importance of metadata; define is ontology and its importance in web parlance; explain interoperability and various methods of interoperability; and discuss protocols for interoperability. 14.1 INTRODUCTION Index is a tool that has been in use for a long time to locate information. It is a list of key words or terms that supplement a document at the end of text for fruitful navigation and browsing. An index not only provides a chance to highlight content and provide a bird’s- 6 8 eye-view to the document, it also helps to identify the inconsistencies and improve Overview of Web upon content of the document for the author. The Web has emerged as an enormous Indexing, Metadata, source of information with a lot of chaotic information content also. Structurally, it is a Interoperability and Ontologies collection of websites hosted at different domains round the globe.
    [Show full text]
  • Bibliometrics, Information Retrieval and Natural Language Processing: Natural Synergies to Support Digital Library Research
    BIRNDL 2016 Joint Workshop on Bibliometric-enhanced Information Retrieval and NLP for Digital Libraries Bibliometrics, Information Retrieval and Natural Language Processing: Natural Synergies to Support Digital Library Research Dietmar Wolfram1 1School of Information Studies, University of Wisconsin-Milwaukee P.O. Box 413, Milwaukee, WI U.S.A. 53201 [email protected] Abstract Historically, researchers have not fully capitalized on the potential synergies that exist between bibliometrics and information retrieval (IR). Knowledge of regularities in information production and use, as well as citation relationships in bibliographic databases that are studied in bibliometrics, can benefit IR system design and evaluation. Similarly, techniques developed for IR and database technology have made the investigation of large-scale bibliometric phenomena feasible. Both fields of study have also benefitted directly from de- velopments in natural language processing (NLP), which have provided new tools and techniques to explore research problems in bibliometrics and IR. Digi- tal libraries, with their full text, multimedia content, along with searching and browsing capabilities, represent ideal environments in which to investigate the mutually beneficial relationships that can be forged among bibliometrics, IR and NLP. This brief presentation highlights the symbiotic relationship that ex- ists among bibliometrics, IR and NLP. Keywords: bibliometrics, information retrieval, digital libraries, natural lan- guage processing 1 Introduction Both information retrieval (IR) and bibliometrics have long histories as distinct areas of investigation in information science. IR has focused on the storage, representation and retrieval of documents (text or other media) from the system and user perspectives. Bibliometrics and its allied areas (informetrics, scientometrics, webmetrics, or simply “met- rics”) have focused on discovering and understanding regularities that exist in the way information is produced and used--but this simple defi- nition belies the breadth of research undertaken.
    [Show full text]
  • Search Engine Optimization for E-Business
    Search Engine Optimization for E-Business Website ك ا ا ا ا ل ا و Prepared by: Nancy Sharaf Student ID: 401020098 Supervised by: Dr. Raed Hnanandeh A THESIS PROPOSAL SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Master OF Electronic-Business Faculty of Business E-Business Department Middle East University Amman-Jordan January, 2013 II III Middle East University for Graduate Studies Authorization Form I ,The Undersigned ( Nancy Shraf ), authorize the Middle East University for Graduate Studies to provide copies of my thesis to all and any university libraries and/or institutions or related parties interested in scientific researches upon their request IV Discussion Committee Decision This thesis has been discussed under the title Search Engine Optimization for E- Business Website "This is to certify that the Thesis entitled was successfully defended and approved May 24th 2010. V ACKNOWLEDGEMENTS This thesis is the product of an educational experience at MEU, various people have contributed towards its completion at different stages, either directly or indirectly, and any attempt to thank all of them is bound to fall short. To begin, I would like to express my whole hearted and sincere gratitude to Dr. Raed Hanandeh and Dr Sharef Jad for their guidance, time, and patience, for supporting me and this thesis during every stage of its development. I would like to extend my special thanks to my family and my work family, without whose encouragement and support; I wouldn’t have been here completing my degree’s final requirements. Sincerely Yours, VI DEDICATIONS To My father and mother soul My Brothers and sisters And to all my friends I dedicate this effort.
    [Show full text]
  • Topic Indexing with Wikipedia
    Topic Indexing with Wikipedia Olena Medelyan, Ian H. Witten and David Milne Computer Science Department University of Waikato New Zealand {olena, ihw, dnk2}@cs.waikato.ac.nz Abstract This paper shows how Wikipedia can be utilized effec- Wikipedia article names can be utilized as a controlled vo- tively for topical indexing. The scheme is evaluated on a cabulary for identifying the main topics in a document. set of 20 computer science articles, indexed by 15 teams of Wikipedia’s 2M articles cover the terminology of nearly any computer science students working independently, two per document collection, which permits controlled indexing in team. The automatic approach outperforms some student the absence of manually created vocabularies. We combine teams, and needs only a very small training set. state-of-the-art strategies for automatic controlled indexing with Wikipedia’s unique property—a richly hyperlinked en- cyclopedia. We evaluate the scheme by comparing auto- 2. Related work matically assigned topics with those chosen manually by human indexers. Analysis of indexing consistency shows One of the largest controlled vocabularies used for index- that our algorithm outperforms some human subjects. ing is the Medical Subject Heading (MeSH) thesaurus. It contains 25,000 concepts and has been applied to both term 1. Introduction assignment and keyphrase indexing, individually and in combination. Markó et al. (2004) decompose document The main topics of a document often indicate whether or phrases into morphemes with a manually created diction- not it is worth reading. In libraries of yore, professional ary and associate them with MeSH terms assigned to the human indexers were employed to manually categorize documents.
    [Show full text]
  • Natural Language and Mathematics Processing for Applicable Theorem Search
    Natural Language and Mathematics Processing for Applicable Theorem Search by Ștefan Anca a thesis for conferral of a Master of Science in Computer Science _______________________________ Prof. Dr. Michael Kohlhase (Jacobs University) Prof. Dr. John Bateman (Universität Bremen) Date of Submission: August 24th, 2009 School of Engineering and Science Declaration The research subsumed in this thesis has been conducted under the supervision of Prof. Dr. Michael Kohlhase from Jacobs University Bremen. All material presented in this Master Thesis is my own, unless specifically stated. I, S¸tefan Anca, hereby declare, that, to the best of my knowledge, the research presented in this Master Thesis contains original and independent results, and it has not been submitted elsewhere for the conferral of a degree. S¸tefan Anca Bremen, August 24th, 2009 Acknowledgements I would like to first of all thank my supervisor, Prof. Dr. Michael Kohlhase, for his continu- ous guidance throughout my entire research within the KWARC group and specifically for this thesis. Using his advice and direction, I have managed to fully grasp the complexity of my research topic and develop my own approach to pursue it. His comments on the final form of this thesis were most valuable and led me to a comprehensive exposition. I would also like to thank the members of the KWARC group for maintaining an exciting research environment, encouraging independent study and research. I also extend my gratitude to the developers of MathWebSearch for continuous support in my research efforts. I would like to thank my friends who took the time to review drafts of this report, especially Andrei Giurgiu, Adrian Djokic, Magdalena Narozniak and Milena Makaveeva.
    [Show full text]
  • Fall 2015 Web Search Engine Architecture Overview Chapter 1,2
    Subject 2 Fall 2015 Web Search Engine Architecture Overview Chapter 1,2,3.1-3.4 Disclaimer: These abbreviated notes DO NOT substitute the textbook for this class. They should be used IN CONJUNCTION with the textbook and the material presented in class. If there is a discrepancy between these notes and the textbook, ALWAYS consider the textbook to be correct. Report such a discrepancy to the instructor so that he resolves it. These notes are only distributed to the students taking this class with A. Gerbessiotis in Fall 2015 ; distribution outside this group of students is NOT allowed. (c) Copyright A. Gerbessiotis. CS 345 : Fall 2015 . All rights reserved. 1 Search Engine Architecture Overview of components We introduce in this subject the architecture of a search engine. It consists of its software components, the interfaces provided by them, and the relationships between any two of them. (An extra level of detail could include the data structures supported.) In this subject, we use the example of an early centralized architecture as reflected by the Altavista search engine of the mid 90s to provide a high-level description of the major components of such a system. We then (Subject 3) give an example of the Google search engine architecture as it was originally developed and used back in 1997 and 1998. There are more components involved in the Google architecture, but a high-level abstraction of that architecture (minus the ranking engine perhaps) is not much different from Altavista's. The first search engines such as Excite (1994), InfoSeek (1994), Altavista(1995) employed primarily Information Retrieval principles and techniques and were search engines that were evaluating the similarity of a query q relative to the web document dj of a corpus of web-documents retrieved from the Web.
    [Show full text]
  • Establishing the Value of Socially Created Metadata to Image Indexing
    This is a preprint of an article published in Library & Information Science Research: Stvilia, B., Jörgensen, C., & Wu, S. (2012). Establishing the value of socially created metadata to image indexing. Library & Information Science Research, 34(2), 99-109. Establishing the Value of Socially Created Metadata to Image Indexing Besiki Stvilia1, Corinne Jörgensen, and Shuheng Wu School of Library and Information Studies College of Communication and Information, Florida State University Tallahassee, FL 32306-2100, USA {bstvilia, cjorgensen, sw09f}@fsu.edu Abstract There have been ample suggestions in the literature that terms added to documents from Flickr and Wikipedia can complement traditional methods of indexing and controlled vocabularies. At the same time, adding new metadata to existing metadata objects may not always add value to those objects. This research examines the potential added value of using user-contributed (“social”) terms from Flickr and the English Wikipedia in image indexing compared with using two expert-created controlled vocabularies— the Thesaurus for Graphic Materials and the Library of Congress Subject Headings. Our experiments confirmed that the social terms did provide added value relative to terms from the controlled vocabularies. The median rating for the usefulness of social terms was significantly higher than the baseline rating but was lower than the ratings for the terms from the Thesaurus for Graphic Materials and the Library of Congress Subject Headings. Furthermore, complementing the controlled vocabulary terms with social terms more than doubled the average coverage of participants’ terms for a photograph. The study also investigated the relationships between user demographics and users’ perceptions of the value of terms, as well as the relationships between user demographics and indexing quality, as measured by the number of terms participants assigned to a photograph.
    [Show full text]