Query Processing Over Relations Extracted from Text Databases.
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Mathematics and Science Textbooks > Science: general issues > Query Processing Over Relations Extracted from Text Databases.
Query Processing Over Relations Extracted from Text Databases.

Query Processing Over Relations Extracted from Text Databases.


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

Text documents often embed data that is structured in nature, and this structured data is increasingly exposed using information extraction systems. Information extraction systems generate structured relations from documents, thus enabling expressive, structured queries over text databases. This dissertation studies the problem of processing structured queries over relations extracted from text databases. To process structured queries over text databases, we face multiple challenges. One key challenge is efficiency: information extraction is a time-consuming process, so query processing strategies should minimize the number of documents that they process. Another key challenge is output quality: information extraction systems are often far from perfect, and might output erroneous information or miss information that they should capture, hence hurting output accuracy and completeness. At the same time, query processing decisions, such as the choice of information extraction systems or document retrieval strategies, also impact the output quality. Finally, depending on the nature of the information need, users may have varying preferences regarding the execution efficiency and quality expected from the querying process. This dissertation builds on the critical observation that, in addition to efficiency, which is important just as in traditional relational query optimization, the output quality of an execution is critical. In our extraction-based scenario, query processing can be decomposed into a sequence of basic steps: retrieving relevant text documents, extracting relations from the documents, and joining extracted relations for queries involving multiple relations. Each of these steps presents different alternatives and together they form a space of possible query execution strategies. Our goal is to consider the user-specified requirements for execution efficiency and quality, and choose an execution strategy for each query based on a principled, cost-based comparison of the alternative execution strategies. We first introduce a simple, integrative optimization approach for processing queries involving single as well as multiple extracted relations. This approach considers each execution strategy as a whole and exploits database-specific statistics to predict the execution strategy characteristics. We then move towards an in-depth understanding of the impact of each component of an execution strategy on the overall execution. With this in mind, we rigorously analyze the critical components of an execution strategy and build statistically robust representations for information extraction systems, as well as statistical models for document retrieval strategies and join processing algorithms. These models help predict the efficiency and output quality of a variety of query execution strategies. Finally, we also consider the common scenario where information extraction systems report the extracted tuple together with scores that reflect the confidence in the correctness of the extracted tuples. Specifically, we present query processing algorithms that leverage these confidence scores and efficiently produce the high-confidence tuples, in turn discarding extracted tuples that are likely to be incorrect. In summary, this thesis presents a principled query optimization approach for processing structured queries over text databases, taking into consideration both the efficiency and the output quality of the query execution strategies. Our hope is that the contributions of this work will help shrink the gap between structured databases and text databases, by enabling the seamless and expressive querying of all available information, ..


Best Sellers


Product Details
  • ISBN-13: 9781243555274
  • Publisher: Proquest, Umi Dissertation Publishing
  • Publisher Imprint: Proquest, Umi Dissertation Publishing
  • Height: 246 mm
  • Weight: 440 gr
  • ISBN-10: 1243555270
  • Publisher Date: 01 Sep 2011
  • Binding: Paperback
  • Spine Width: 13 mm
  • Width: 189 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Query Processing Over Relations Extracted from Text Databases.
Proquest, Umi Dissertation Publishing -
Query Processing Over Relations Extracted from Text Databases.
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Query Processing Over Relations Extracted from Text Databases.

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!