SlideShare a Scribd company logo
1 of 34
Surajit Chaudhuri, Microsoft Research Gautam Das, Microsoft Research Vagelis Hristidis, Florida International University Gerhard Weikum, MPI Informatik 30th VLDB Conference Toronto ,Canada,2004 Presented By  Abhishek Jamloki [email_address]
[object Object],[object Object],[object Object],[object Object],[object Object]
Consider a database table D with n tuples {t1, …, tn} over a set of m  categorical attributes A = {A1, …, Am} a query Q: SELECT * FROM D WHERE X1=x1 AND … AND Xs=xs where each Xi is an attribute from A and xi  is a value in its domain.  specified attributes: X ={X1, …, Xs} unspecified attributes: Y = A – X Let S be the answer set of Q How to rank tuples in S and return top-k tuples to the user?
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
 
[object Object],[object Object],Document  t , Query  Q R : Relevant document set R  =  D - R : Irrelevant document set
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
 
[object Object],[object Object],[object Object]
 
[object Object],[object Object],[object Object],[object Object],[object Object]
 
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
 
 
[object Object],[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object],[object Object]
[object Object],[object Object],[object Object]
[object Object]
[object Object],[object Object]
 
 
 
 
[object Object],[object Object],[object Object]
[object Object],[object Object]

More Related Content

What's hot

Linear regression with R 1
Linear regression with R 1Linear regression with R 1
Linear regression with R 1
Kazuki Yoshida
 
R short-refcard
R short-refcardR short-refcard
R short-refcard
conline
 

What's hot (18)

R language
R languageR language
R language
 
Linear regression with R 1
Linear regression with R 1Linear regression with R 1
Linear regression with R 1
 
R Language Introduction
R Language IntroductionR Language Introduction
R Language Introduction
 
R reference card
R reference cardR reference card
R reference card
 
Introduction to R Programming
Introduction to R ProgrammingIntroduction to R Programming
Introduction to R Programming
 
R Programming Tutorial for Beginners - -TIB Academy
R Programming Tutorial for Beginners - -TIB AcademyR Programming Tutorial for Beginners - -TIB Academy
R Programming Tutorial for Beginners - -TIB Academy
 
R Reference Card for Data Mining
R Reference Card for Data MiningR Reference Card for Data Mining
R Reference Card for Data Mining
 
Data structure and algorithm All in One
Data structure and algorithm All in OneData structure and algorithm All in One
Data structure and algorithm All in One
 
No more struggles with Apache Spark workloads in production
No more struggles with Apache Spark workloads in productionNo more struggles with Apache Spark workloads in production
No more struggles with Apache Spark workloads in production
 
R short-refcard
R short-refcardR short-refcard
R short-refcard
 
Statistics lab 1
Statistics lab 1Statistics lab 1
Statistics lab 1
 
Hadoop exercise
Hadoop exerciseHadoop exercise
Hadoop exercise
 
Data structures and algorithms
Data structures and algorithmsData structures and algorithms
Data structures and algorithms
 
R programming intro with examples
R programming intro with examplesR programming intro with examples
R programming intro with examples
 
Introduction to R
Introduction to RIntroduction to R
Introduction to R
 
Datastructures using c++
Datastructures using c++Datastructures using c++
Datastructures using c++
 
Chapter 10 ds
Chapter 10 dsChapter 10 ds
Chapter 10 ds
 
Chapter 3 ds
Chapter 3 dsChapter 3 ds
Chapter 3 ds
 

Viewers also liked

Filpbook Powerpoint Ryerson
Filpbook Powerpoint RyersonFilpbook Powerpoint Ryerson
Filpbook Powerpoint Ryerson
RyersonC
 
Magazine cover comparison
Magazine cover comparisonMagazine cover comparison
Magazine cover comparison
guest0aa71a
 
Order of Operations
Order of OperationsOrder of Operations
Order of Operations
Yousef
 
Unit 11d Property disadvantages
Unit 11d Property disadvantagesUnit 11d Property disadvantages
Unit 11d Property disadvantages
Andrew Hingston
 
Lauren’s lovely long lasting summer
Lauren’s lovely long lasting summerLauren’s lovely long lasting summer
Lauren’s lovely long lasting summer
The Lower School
 
Schoolmagquestions
SchoolmagquestionsSchoolmagquestions
Schoolmagquestions
guest4cb2894
 
The Impossible Quiz
The Impossible QuizThe Impossible Quiz
The Impossible Quiz
Yusuf Aziz
 
Ppt mikelresolutions
Ppt mikelresolutionsPpt mikelresolutions
Ppt mikelresolutions
MIKOT
 

Viewers also liked (20)

Slide Chinh Thuc
Slide Chinh ThucSlide Chinh Thuc
Slide Chinh Thuc
 
Reason and logic
Reason and logicReason and logic
Reason and logic
 
Interacting with the Exchange Web Services
Interacting with the Exchange Web ServicesInteracting with the Exchange Web Services
Interacting with the Exchange Web Services
 
Filpbook Powerpoint Ryerson
Filpbook Powerpoint RyersonFilpbook Powerpoint Ryerson
Filpbook Powerpoint Ryerson
 
Carrer interests
Carrer interestsCarrer interests
Carrer interests
 
Magazine cover comparison
Magazine cover comparisonMagazine cover comparison
Magazine cover comparison
 
Building People
Building PeopleBuilding People
Building People
 
segurtasuna interneten
segurtasuna internetensegurtasuna interneten
segurtasuna interneten
 
The Norwegian Gem
The Norwegian GemThe Norwegian Gem
The Norwegian Gem
 
Presentaci Power Point[1]
Presentaci Power  Point[1]Presentaci Power  Point[1]
Presentaci Power Point[1]
 
Order of Operations
Order of OperationsOrder of Operations
Order of Operations
 
Unit 11d Property disadvantages
Unit 11d Property disadvantagesUnit 11d Property disadvantages
Unit 11d Property disadvantages
 
Lauren’s lovely long lasting summer
Lauren’s lovely long lasting summerLauren’s lovely long lasting summer
Lauren’s lovely long lasting summer
 
Schoolmagquestions
SchoolmagquestionsSchoolmagquestions
Schoolmagquestions
 
2016 01 04 kriton curi konser resimleri
2016 01 04 kriton curi konser resimleri2016 01 04 kriton curi konser resimleri
2016 01 04 kriton curi konser resimleri
 
Cowboy Writing Tasks
Cowboy Writing TasksCowboy Writing Tasks
Cowboy Writing Tasks
 
Tabby Cat
Tabby CatTabby Cat
Tabby Cat
 
The Impossible Quiz
The Impossible QuizThe Impossible Quiz
The Impossible Quiz
 
Подготовка кадров: опыт взаимодействия с системой дошкольного, среднего и выс...
Подготовка кадров: опыт взаимодействия с системой дошкольного, среднего и выс...Подготовка кадров: опыт взаимодействия с системой дошкольного, среднего и выс...
Подготовка кадров: опыт взаимодействия с системой дошкольного, среднего и выс...
 
Ppt mikelresolutions
Ppt mikelresolutionsPpt mikelresolutions
Ppt mikelresolutions
 

Similar to IR-ranking

IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD Editor
 
20130215 Reading data into R
20130215 Reading data into R20130215 Reading data into R
20130215 Reading data into R
Kazuki Yoshida
 
14. Query Optimization in DBMS
14. Query Optimization in DBMS14. Query Optimization in DBMS
14. Query Optimization in DBMS
koolkampus
 
probabilistic ranking
probabilistic rankingprobabilistic ranking
probabilistic ranking
FELIX75
 
CS 542 -- Query Optimization
CS 542 -- Query OptimizationCS 542 -- Query Optimization
CS 542 -- Query Optimization
J Singh
 

Similar to IR-ranking (20)

Practical data science_public
Practical data science_publicPractical data science_public
Practical data science_public
 
4 R Tutorial DPLYR Apply Function
4 R Tutorial DPLYR Apply Function4 R Tutorial DPLYR Apply Function
4 R Tutorial DPLYR Apply Function
 
R command cheatsheet.pdf
R command cheatsheet.pdfR command cheatsheet.pdf
R command cheatsheet.pdf
 
@ R reference
@ R reference@ R reference
@ R reference
 
R Programming Reference Card
R Programming Reference CardR Programming Reference Card
R Programming Reference Card
 
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...
 
Short Reference Card for R users.
Short Reference Card for R users.Short Reference Card for R users.
Short Reference Card for R users.
 
Reference card for R
Reference card for RReference card for R
Reference card for R
 
20170509 rand db_lesugent
20170509 rand db_lesugent20170509 rand db_lesugent
20170509 rand db_lesugent
 
Broom: Converting Statistical Models to Tidy Data Frames
Broom: Converting Statistical Models to Tidy Data FramesBroom: Converting Statistical Models to Tidy Data Frames
Broom: Converting Statistical Models to Tidy Data Frames
 
20130215 Reading data into R
20130215 Reading data into R20130215 Reading data into R
20130215 Reading data into R
 
R교육1
R교육1R교육1
R교육1
 
14. Query Optimization in DBMS
14. Query Optimization in DBMS14. Query Optimization in DBMS
14. Query Optimization in DBMS
 
2 data structure in R
2 data structure in R2 data structure in R
2 data structure in R
 
The Other HPC: High Productivity Computing in Polystore Environments
The Other HPC: High Productivity Computing in Polystore EnvironmentsThe Other HPC: High Productivity Computing in Polystore Environments
The Other HPC: High Productivity Computing in Polystore Environments
 
probabilistic ranking
probabilistic rankingprobabilistic ranking
probabilistic ranking
 
CS 542 -- Query Optimization
CS 542 -- Query OptimizationCS 542 -- Query Optimization
CS 542 -- Query Optimization
 
Data Analytics with R and SQL Server
Data Analytics with R and SQL ServerData Analytics with R and SQL Server
Data Analytics with R and SQL Server
 
Intelligent Methods in Models of Text Information Retrieval: Implications for...
Intelligent Methods in Models of Text Information Retrieval: Implications for...Intelligent Methods in Models of Text Information Retrieval: Implications for...
Intelligent Methods in Models of Text Information Retrieval: Implications for...
 
Q
QQ
Q
 

More from FELIX75

technorati
technoratitechnorati
technorati
FELIX75
 
technorati
technoratitechnorati
technorati
FELIX75
 
probabilistic ranking
probabilistic rankingprobabilistic ranking
probabilistic ranking
FELIX75
 
probabilistic ranking
probabilistic rankingprobabilistic ranking
probabilistic ranking
FELIX75
 
probabilistic ranking
probabilistic rankingprobabilistic ranking
probabilistic ranking
FELIX75
 
probabilistic ranking
probabilistic rankingprobabilistic ranking
probabilistic ranking
FELIX75
 
DB-IR-ranking
DB-IR-rankingDB-IR-ranking
DB-IR-ranking
FELIX75
 

More from FELIX75 (8)

technorati
technoratitechnorati
technorati
 
technorati
technoratitechnorati
technorati
 
php
phpphp
php
 
probabilistic ranking
probabilistic rankingprobabilistic ranking
probabilistic ranking
 
probabilistic ranking
probabilistic rankingprobabilistic ranking
probabilistic ranking
 
probabilistic ranking
probabilistic rankingprobabilistic ranking
probabilistic ranking
 
probabilistic ranking
probabilistic rankingprobabilistic ranking
probabilistic ranking
 
DB-IR-ranking
DB-IR-rankingDB-IR-ranking
DB-IR-ranking
 

Recently uploaded

Architecting Cloud Native Applications
Architecting Cloud Native ApplicationsArchitecting Cloud Native Applications
Architecting Cloud Native Applications
WSO2
 

Recently uploaded (20)

Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
 
Architecting Cloud Native Applications
Architecting Cloud Native ApplicationsArchitecting Cloud Native Applications
Architecting Cloud Native Applications
 
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot TakeoffStrategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
 
Boost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdfBoost Fertility New Invention Ups Success Rates.pdf
Boost Fertility New Invention Ups Success Rates.pdf
 
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin WoodPolkadot JAM Slides - Token2049 - By Dr. Gavin Wood
Polkadot JAM Slides - Token2049 - By Dr. Gavin Wood
 
Artificial Intelligence Chap.5 : Uncertainty
Artificial Intelligence Chap.5 : UncertaintyArtificial Intelligence Chap.5 : Uncertainty
Artificial Intelligence Chap.5 : Uncertainty
 
Strategies for Landing an Oracle DBA Job as a Fresher
Strategies for Landing an Oracle DBA Job as a FresherStrategies for Landing an Oracle DBA Job as a Fresher
Strategies for Landing an Oracle DBA Job as a Fresher
 
Emergent Methods: Multi-lingual narrative tracking in the news - real-time ex...
Emergent Methods: Multi-lingual narrative tracking in the news - real-time ex...Emergent Methods: Multi-lingual narrative tracking in the news - real-time ex...
Emergent Methods: Multi-lingual narrative tracking in the news - real-time ex...
 
Apidays New York 2024 - Accelerating FinTech Innovation by Vasa Krishnan, Fin...
Apidays New York 2024 - Accelerating FinTech Innovation by Vasa Krishnan, Fin...Apidays New York 2024 - Accelerating FinTech Innovation by Vasa Krishnan, Fin...
Apidays New York 2024 - Accelerating FinTech Innovation by Vasa Krishnan, Fin...
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
Repurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost Saving
Repurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost SavingRepurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost Saving
Repurposing LNG terminals for Hydrogen Ammonia: Feasibility and Cost Saving
 
Navi Mumbai Call Girls 🥰 8617370543 Service Offer VIP Hot Model
Navi Mumbai Call Girls 🥰 8617370543 Service Offer VIP Hot ModelNavi Mumbai Call Girls 🥰 8617370543 Service Offer VIP Hot Model
Navi Mumbai Call Girls 🥰 8617370543 Service Offer VIP Hot Model
 
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, AdobeApidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
 
A Beginners Guide to Building a RAG App Using Open Source Milvus
A Beginners Guide to Building a RAG App Using Open Source MilvusA Beginners Guide to Building a RAG App Using Open Source Milvus
A Beginners Guide to Building a RAG App Using Open Source Milvus
 
A Year of the Servo Reboot: Where Are We Now?
A Year of the Servo Reboot: Where Are We Now?A Year of the Servo Reboot: Where Are We Now?
A Year of the Servo Reboot: Where Are We Now?
 
Apidays Singapore 2024 - Scalable LLM APIs for AI and Generative AI Applicati...
Apidays Singapore 2024 - Scalable LLM APIs for AI and Generative AI Applicati...Apidays Singapore 2024 - Scalable LLM APIs for AI and Generative AI Applicati...
Apidays Singapore 2024 - Scalable LLM APIs for AI and Generative AI Applicati...
 
TrustArc Webinar - Unlock the Power of AI-Driven Data Discovery
TrustArc Webinar - Unlock the Power of AI-Driven Data DiscoveryTrustArc Webinar - Unlock the Power of AI-Driven Data Discovery
TrustArc Webinar - Unlock the Power of AI-Driven Data Discovery
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
 
TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
TrustArc Webinar - Stay Ahead of US State Data Privacy Law DevelopmentsTrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
 
Apidays Singapore 2024 - Modernizing Securities Finance by Madhu Subbu
Apidays Singapore 2024 - Modernizing Securities Finance by Madhu SubbuApidays Singapore 2024 - Modernizing Securities Finance by Madhu Subbu
Apidays Singapore 2024 - Modernizing Securities Finance by Madhu Subbu
 

IR-ranking

  • 1. Surajit Chaudhuri, Microsoft Research Gautam Das, Microsoft Research Vagelis Hristidis, Florida International University Gerhard Weikum, MPI Informatik 30th VLDB Conference Toronto ,Canada,2004 Presented By Abhishek Jamloki [email_address]
  • 2.
  • 3. Consider a database table D with n tuples {t1, …, tn} over a set of m categorical attributes A = {A1, …, Am} a query Q: SELECT * FROM D WHERE X1=x1 AND … AND Xs=xs where each Xi is an attribute from A and xi is a value in its domain. specified attributes: X ={X1, …, Xs} unspecified attributes: Y = A – X Let S be the answer set of Q How to rank tuples in S and return top-k tuples to the user?
  • 4.
  • 5.  
  • 6.
  • 7.
  • 8.  
  • 9.
  • 10.  
  • 11.
  • 12.  
  • 13.
  • 14.
  • 15.
  • 16.
  • 17.
  • 18.
  • 19.
  • 20.
  • 21.  
  • 22.  
  • 23.
  • 24.
  • 25.
  • 26.
  • 27.
  • 28.
  • 29.  
  • 30.  
  • 31.  
  • 32.  
  • 33.
  • 34.