DBMS with probabilistic model

Slides:



Advertisements
Similar presentations
Uncertainty in Data Integration Ai Jing
Advertisements

Information Retrieval and Organisation Chapter 11 Probabilistic Information Retrieval Dell Zhang Birkbeck, University of London.
Representing and Querying Correlated Tuples in Probabilistic Databases
Exercising these ideas  You have a description of each item in a small collection. (30 web sites)  Assume we are looking for information about boxers,
A Probabilistic Framework for Information Integration and Retrieval on the Semantic Web by Livia Predoiu, Heiner Stuckenschmidt Institute of Computer Science,
Data Integration Aggregate Query Answering under Uncertain Schema Mappings Avigdor Gal, Maria Vanina Martinez, Gerardo I. Simari, VS Subrahmanian Presented.
IR Challenges and Language Modeling. IR Achievements Search engines  Meta-search  Cross-lingual search  Factoid question answering  Filtering Statistical.
Models for Information Retrieval Mainly used in science and research, (probably?) less often in real systems But: Research results have significance for.
Question Answering using Language Modeling Some workshop-level thoughts.
FACT: A Learning Based Web Query Processing System Hongjun Lu, Yanlei Diao Hong Kong U. of Science & Technology Songting Chen, Zengping Tian Fudan University.
Semantic (Language) Models: Robustness, Structure & Beyond Thomas Hofmann Department of Computer Science Brown University Chief Scientist.
Top-k Queries on Uncertain Data: On score Distribution and Typical Answers Presented by Qian Wan, HKUST Based on [1][2]
ITCS 6010 Natural Language Understanding. Natural Language Processing What is it? Studies the problems inherent in the processing and manipulation of.
Web Search – Summer Term 2006 II. Information Retrieval (Basics) (c) Wolfgang Hürst, Albert-Ludwigs-University.
Information Retrieval – Introduction and Survey Norbert Fuhr University of Duisburg-Essen Germany
Lowell 2003 Challenges Alon Y. Halevy University of Washington.
DBrev: Dreaming of a Database Revolution Gjergji Kasneci, Jurgen Van Gael, Thore Graepel Microsoft Research Cambridge, UK.
Homework 4 Final homework Deadline: Sunday April 20, PM In this homework you have to write a short essay on how Google can handle new types of data.
Collocations and Information Management Applications Gregor Erbach Saarland University Saarbrücken.
MIND: An architecture for multimedia information retrieval in federated digital libraries Henrik Nottelmann University of Dortmund, Germany.
Querying Web Data – The WebQA Approach Author: Sunny K.S.Lam and M.Tamer Özsu CSI5311 Presentation Dongmei Jiang and Zhiping Duan.
Query Processing over Incomplete Autonomous Databases Presented By Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianchun Fan, Yi Chen, Subbarao Kambhampati.
All right reserved by Xuehua Shen 1 Optimal Aggregation Algorithms for Middleware Ronald Fagin, Amnon Lotem, Moni Naor (PODS01)
For Monday Read chapter 26 Last Homework –Chapter 23, exercise 7.
Data Integration Hanna Zhong Department of Computer Science University of Illinois, Urbana-Champaign 11/12/2009.
Performance Measurement. 2 Testing Environment.
Web Search and Text Mining Lecture 5. Outline Review of VSM More on LSI through SVD Term relatedness Probabilistic LSI.
CSE 6392 – Data Exploration and Analysis in Relational Databases April 20, 2006.
Ranking of Database Query Results Nitesh Maan, Arujn Saraswat, Nishant Kapoor.
1 Entity Search Engine: Towards Agile Best-Effort Information Integration over the Web Tao Cheng, Kevin Chang University Of Illinois, Urbana-Champaign.
Relevance Models and Answer Granularity for Question Answering W. Bruce Croft and James Allan CIIR University of Massachusetts, Amherst.
CS798: Information Retrieval Charlie Clarke Information retrieval is concerned with representing, searching, and manipulating.
Basics of Databases and Information Retrieval1 Databases and Information Retrieval Lecture 1 Basics of Databases and Information Retrieval Instructor Mr.
For Monday Read chapter 26 Homework: –Chapter 23, exercises 8 and 9.
Welcome to CPSC 534B: Information Integration Laks V.S. Lakshmanan Rm. 315.
Databases and DBMSs Todd S. Bacastow January
Supporting Ranking and Clustering as Generalized Order-By and Group-By
CS 540 Database Management Systems
Architetture della Informazione Anno accademico Carlo Batini Methodologies for planning the evolution of data architectures 1.
Information Retrieval
Avi Silberschatz Department of Computer Science Yale University
INFORMATION RETRIEVAL
What is IR? In the 70’s and 80’s, much of the research focused on document retrieval In 90’s TREC reinforced the view that IR = document retrieval Document.
What is a Database and Why Use One?
Queries with Difference on Probabilistic Databases
Question Answering via Question-to-Question Mapping
Lecture 16: Probabilistic Databases
Information Retrieval
HITS Hypertext Induced Topic Selection
Distributed Databases
Selected Topics: External Sorting, Join Algorithms, …
موضوع پروژه : بازیابی اطلاعات Information Retrieval
Probabilistic Data Management
Data Mining Chapter 6 Search Engines
Interactive Information Access to Federations of DL Services
Distributed Probabilistic Range-Aggregate Query on Uncertain Data
HITS Hypertext Induced Topic Selection
Initiate a Review using the iPERMS Web Based Training Database
Log in to the iPERMS Web Based Training Database
Results Fusion in Heterogeneous Information Sources
Observations on DB & IR and Conclusions
Log in to the iPERMS Web Based Training Database
Distributed Databases
Information Retrieval and Web Design
Probabilistic Information Retrieval
Cycle 3: Unit 27 Lessons 104 – 111.
Distributed Databases
Best Practices in Higher Education Student Data Warehousing Forum
Questions and Answers (Q&A)
Fading Schemas… Alon Y. Halevy.
Presentation transcript:

DBMS with probabilistic model Probabilities and uncertainty taken seriously as foundation for the database model – not an add-on old idea but never taken seriously e.g. Fuhr’s Probabilistic Datalog Probabilistic retrieval model, probabilistic schema, uncertain queries, learning, appropriate data structures, etc.

IR queries for DBMS Not the same as NL queries work done in 80s Take a NL query, apply it to a DBMS, determine what type of answer can be provided may be fact-type answer (QA) may be ranked tuples (IR) Useful for distributed, heterogeneous search e.g. Hidden Web should not require wrappers