the distinct method
play

The distinct() method IN TRODUCTION TO MON GODB IN P YTH ON - PowerPoint PPT Presentation

Oct 20, 2023 •146 likes •357 views

The distinct() method IN TRODUCTION TO MON GODB IN P YTH ON Donny Winston Instructor An exceptional laureate db.laureates.find_one({"prizes.2": {"$exists": True}}) {'_id': ObjectId('5baacf97f35b632bbe12c1ad'), 'born':

  1. The distinct() method IN TRODUCTION TO MON GODB IN P YTH ON Donny Winston Instructor

  2. An exceptional laureate db.laureates.find_one({"prizes.2": {"$exists": True}}) {'_id': ObjectId('5baacf97f35b632bbe12c1ad'), 'born': '0000-00-00', 'died': '0000-00-00', 'firstname': ('Comité international de la Croix Rouge' '(International Committee of the Red Cross)'), 'gender': 'org', 'id': '482', 'prizes': [{'affiliations': [[]], 'category': 'peace', 'share': '1', 'year': '1917'}, {'affiliations': [[]], 'category': 'peace', 'share': '1', 'year': '1944'}, {'affiliations': [[]], 'category': 'peace', 'share': '2', 'year': '1963'}]} INTRODUCTION TO MONGODB IN PYTHON

  3. Using .distinct() db.laureates.distinct("gender") ['male', 'female', 'org'] A convenience method for a common aggregation (like count_documents ) We will learn how to create custom aggregations in Chapter 4 distinct aggregation is ef�cient if there is a collection index on the �eld We will learn how to create an index in Chapter 3 No index needed here: collection �ts in memory, has ?1,000 documents INTRODUCTION TO MONGODB IN PYTHON

  4. .distinct() with dot notation db.laureates.find_one({"prizes.2": {"$exists": True}}) db.laureates.distinct("prizes.category") {'_id': ObjectId('5baacf97f35b632bbe12c1ad'), ['physics', 'chemistry', 'peace', 'born': '0000-00-00', 'medicine', 'literature', 'economics'] 'died': '0000-00-00', 'firstname': ('Comité international de la Croix Rouge' ['physics', 'chemistry', 'peace', 'medicine', 'literature', 'economi '(International Committee of the Red Cross)'), 'gender': 'org', 'id': '482', 'prizes': [{'affiliations': [[]], 'category': 'peace', 'share': '1', 'year': '1917'}, {'affiliations': [[]], 'category': 'peace', 'share': '1', 'year': '1944'}, {'affiliations': [[]], 'category': 'peace', 'share': '2', 'year': '1963'}]} INTRODUCTION TO MONGODB IN PYTHON

  5. Let's practice! IN TRODUCTION TO MON GODB IN P YTH ON

  6. Pre-�ltering distinct values IN TRODUCTION TO MON GODB IN P YTH ON Donny Winston Instructor

  7. Awards into prize shares db.laureates.find_one({"prizes.share": "4"}) {'bornCountry': 'France', 'died': '1906-04-19', 'diedCountry': 'France',, 'firstname': 'Pierre', 'prizes': [{'affiliations': [{'city': 'Paris', 'country': 'France', 'name': ('École municipale de physique et de chimie' 'industrielles (Municipal School of Industrial' 'Physics and Chemistry)')}], 'motivation': ('"in recognition of the extraordinary' 'services they have rendered by their' 'joint researches on the radiation' 'phenomena discovered by Professor' 'Henri Becquerel"'), 'category': 'physics', 'share': '4', 'year': '1903'}], 'surname': 'Curie', ... } INTRODUCTION TO MONGODB IN PYTHON

  8. High-share prize categories db.laureates.distinct("prizes.category") db.laureates.distinct( "prizes.category", {"prizes.share": '4'}) ['physics', 'chemistry', 'peace', 'medicine', 'literature', 'economics'] ['physics', 'chemistry', 'medicine'] list(db.laureates.find({"prizes.share": "4"})) db.prizes.distinct("category", {"laureates.share": "4"}) [...] ['physics', 'medicine', 'chemistry'] INTRODUCTION TO MONGODB IN PYTHON

  9. Prize categories with multi-winners db.laureates.count_documents({"prizes.1": {"$exists": True}}) 6 db.laureates.distinct( "prizes.category", {"prizes.1": {"$exists": True}}) ['chemistry', 'physics', 'peace'] # We'll learn how to do this in the next chapter: [[{'category': 'physics'}, {'category': 'chemistry'}], [{'category': 'physics'}, {'category': 'physics'}], [{'category': 'chemistry'}, {'category': 'peace'}], [{'category': 'chemistry'}, {'category': 'chemistry'}], [{'category': 'peace'}, {'category': 'peace'}, {'category': 'peace'}], [{'category': 'peace'}, {'category': 'peace'}]] INTRODUCTION TO MONGODB IN PYTHON

  10. Practice time! IN TRODUCTION TO MON GODB IN P YTH ON

  11. Matching array �elds IN TRODUCTION TO MON GODB IN P YTH ON Donny Winston Instructor

  12. Array �elds and equality {'firstname': 'John', 'surname': 'Bardeen', 'prizes': [{ 'category': 'physics', 'year': '1956', 'share': '3', 'motivation': ('"for their researches on semiconductors and their' 'discovery of the transistor effect"'), ... }, { 'category': 'physics', 'year': '1972', 'share': '3', 'motivation': ('"for their jointly developed theory of' 'superconductivity, usually called the BCS-theory"'), ... }], ... } db.laureates.count_documents({"prizes.category": "physics"}) 206 INTRODUCTION TO MONGODB IN PYTHON

  13. Array �elds and equality, simpli�ed # Imaginary extra field in John Bardeen's document: {"nicknames": ["Johnny", "JSwitch", "JB". "Tc Johnny", "Bardy"]} db.laureates.find({"nicknames": "JB"}) # different than {"nicknames": ["JB"]} INTRODUCTION TO MONGODB IN PYTHON

  14. Array �elds and operators db.laureates.count_documents( db.laureates.count_documents({ {"prizes.category": "physics"}) "prizes.category": { "$in": ["physics", "chemistry", "medicine"]}}) 206 596 db.laureates.count_documents( {"prizes.category": {"$ne": "physics"}}) db.laureates.count_documents({ "prizes.category": { "$nin": ["physics", "chemistry", "medicine"]}}) 716 326 326 INTRODUCTION TO MONGODB IN PYTHON

  15. Enter $elemMatch db.laureates.count_documents({ db.laureates.count_documents({ "prizes": { "prizes": {"$elemMatch": "category": "physics", "share": "1"}}) {"category": "physics", "share": "1"}}}) 0 47 db.laureates.count_documents({ db.laureates.count_documents({ "prizes.category": "physics", "prizes.share": "1"}) "prizes": {"$elemMatch": { "category": "physics", "share": "1", 48 "year": {"$lt": "1945"},}}}) 29 29 INTRODUCTION TO MONGODB IN PYTHON

  16. Onward and array- ward! IN TRODUCTION TO MON GODB IN P YTH ON

  17. Distinct As You Like It: Filtering with Regular Expressions IN TRODUCTION TO MON GODB IN P YTH ON Donny Winston Instructor

  18. Finding a substring with $regex db.laureates.find_one({"firstname": "Marie"}) db.laureates.distinct("bornCountry", {"bornCountry": {"$regex": "Poland"}}) {'born': '1867-11-07', 'bornCity': 'Warsaw', ['Russian Empire (now Poland)', 'bornCountry': 'Russian Empire (now Poland)', 'Prussia (now Poland)', 'firstname': 'Marie', 'Germany (now Poland)', 'surname': 'Curie, née Sklodowska', 'Austria-Hungary (now Poland)', ...} 'German-occupied Poland (now Poland)', 'Poland', 'Poland (now Ukraine)', 'Poland (now Lithuania)', 'Poland (now Belarus)', 'Free City of Danzig (now Poland)'] INTRODUCTION TO MONGODB IN PYTHON

  19. Flag options for regular expressions case_sensitive = db.laureates.distinct( import re "bornCountry", {"bornCountry": {"$regex": "Poland"}}) db.laureates.distinct("bornCountry", {"bornCountry": re.compile("poland", re.I)}) case_insensitive = db.laureates.distinct( "bornCountry", ['Russian Empire (now Poland)', ...] {"bornCountry": {"$regex": "poland", "$options": "i"}}) assert set(case_sensitive) == set(case_insensitive) from bson.regex import Regex db.laureates.distinct("bornCountry", {"bornCountry": Regex("poland", "i")}) ['Russian Empire (now Poland)', ...] INTRODUCTION TO MONGODB IN PYTHON

  20. Beginning and ending (and escaping) from bson.regex import Regex db.laureates.distinct( "bornCountry", db.laureates.distinct("bornCountry", {"bornCountry": Regex("now Poland\)$")}) {"bornCountry": Regex("^Poland")}) ['Russian Empire (now Poland)', ['Poland', 'Prussia (now Poland)', 'Poland (now Ukraine)', 'Germany (now Poland)', 'Poland (now Lithuania)', 'Austria-Hungary (now Poland)', 'Poland (now Belarus)'] 'German-occupied Poland (now Poland)', 'Free City of Danzig (now Poland)'] db.laureates.distinct( "bornCountry", {"bornCountry": Regex("^Poland \(now")}) ['Poland (now Ukraine)', 'Poland (now Lithuania)', 'Poland (now Belarus)'] INTRODUCTION TO MONGODB IN PYTHON

  21. Let's practice! IN TRODUCTION TO MON GODB IN P YTH ON

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

On the number of distinct solutions generated by the simplex method for LP . . . . .

On the number of distinct solutions generated by the simplex method for LP . . . . .

Retrospective Workshop Fields Institute Toronto, Ontario, Canada . . On the number of distinct solutions generated by the simplex method for LP . . . . . Tomonari Kitahara and Shinji Mizuno Tokyo Institute of Technology November

707 views • 55 slides
k -means clustering Method to automatically separate data sets into distinct groups. Clustering

k -means clustering Method to automatically separate data sets into distinct groups. Clustering

k -means clustering Method to automatically separate data sets into distinct groups. Clustering example Clustering example k -means clustering algorithm 1. Start with k randomly chosen means 2. Color data points by the shortest distance to any

1.56k views • 19 slides
Dichotomies and Growth Function Matthieu R. Bloch 1 Motivation For a hypothesis set H with |H| =

Dichotomies and Growth Function Matthieu R. Bloch 1 Motivation For a hypothesis set H with |H| =

1 (1) tuitively, we are hoping that the number of distinct labelings is quantity that better captures the attempt to assess the number of hypotheses that lead to distinct labelings for a given dataset. In- Figure 1: Two distinct classsifiers with

293 views • 3 slides
mRNA purification through fragmentation Distinct 28S ribosomal Distinct 18S subunit (or prok.

mRNA purification through fragmentation Distinct 28S ribosomal Distinct 18S subunit (or prok.

mRNA purification through fragmentation Distinct 28S ribosomal Distinct 18S subunit (or prok. 23S): ribosomal 28S ideally 2X size of 18S subunit (or prok. 16S) 18S No well defined peaks between Flat baseline Marker throughout

362 views • 12 slides
The Scientific Method The Scientific Method The Scientific Method involves 6 steps: Problem

The Scientific Method The Scientific Method The Scientific Method involves 6 steps: Problem

The Scientific Method The Scientific Method The Scientific Method involves 6 steps: Problem /Question Research Hypothesis Experiment Data (Results /Observation) Conclusion The Scientific Method The scientific method idea is the method on

310 views • 11 slides
Distinct Value Estimators For Zipfian Distributions Sergei Vassilvitskii Rajeev Motwani

Distinct Value Estimators For Zipfian Distributions Sergei Vassilvitskii Rajeev Motwani

Distinct Value Estimators For Zipfian Distributions Sergei Vassilvitskii Rajeev Motwani Stanford University Problem Statement Given a large multiset with elements, count X n the number of distinct elements in . X X = { a, b,

267 views • 23 slides
Core partitions into distinct parts and an analog of Eulers theorem International Conference

Core partitions into distinct parts and an analog of Eulers theorem International Conference

Core partitions into distinct parts and an analog of Eulers theorem International Conference on Number Theory in honor of Krishna Alladis 60th birthday Armin Straub Mar 19, 2016 University of South Alabama Core partitions into distinct

552 views • 54 slides
GROUP BY AND HAVING So far, weve applied aggregation operatorsto all (qualifying) tuples.

GROUP BY AND HAVING So far, weve applied aggregation operatorsto all (qualifying) tuples.

M ATH IN SQL A GGREGATION O PERATORS Operators on sets of tuples. Significant extension of relational algebra. SUM ( [DISTINCT] A): the sum of all (unique) values in attribute A. AVG ( [DISTINCT] A): the average of all (unique)

288 views • 9 slides
Old English Nouns: Survival Kit P . S. Langeslag Distinct Forms of a Typical Present-Day English

Old English Nouns: Survival Kit P . S. Langeslag Distinct Forms of a Typical Present-Day English

Old English Nouns: Survival Kit P . S. Langeslag Distinct Forms of a Typical Present-Day English Noun Orthographically Distinct Phonetically Distinct girl /l/ girls /lz/ girls girls Present-Day English

341 views • 22 slides
Derangements Debdeep Mukhopadhyay IIT Madras The basic problem A permutation of n distinct

Derangements Debdeep Mukhopadhyay IIT Madras The basic problem A permutation of n distinct

Derangements Debdeep Mukhopadhyay IIT Madras The basic problem A permutation of n distinct objects in which none of the objects is in its natural or original place is called derangement. We represent the number of n distinct objects

234 views • 9 slides
Halls Condition Given a collection of sets A 1 , . . . , A n , a System of Distinct

Halls Condition Given a collection of sets A 1 , . . . , A n , a System of Distinct

Halls Condition Given a collection of sets A 1 , . . . , A n , a System of Distinct Representatives (SDR) is a collection of distinct elements x 1 , . . . , x n so that, for 1 i n , x i A i . Given an index set J { 1 , 2 , . . . ,

89 views • 6 slides
Assume we are reading a stream of n distinct integers in { 1 , . . . , n + 1 } .

Assume we are reading a stream of n distinct integers in { 1 , . . . , n + 1 } .

1 Let us now waive the assumption that the integersare distinct and let us design an algorithm client (dis-)connecting. We assume that the stream is wellformed, i.e. that there are always at i.e. only a constant number of integers. We model the

169 views • 4 slides
Homogeneous Linear Systems Three Cases: Distinct Real Eigenvalues Repeated Eigenvalues

Homogeneous Linear Systems Three Cases: Distinct Real Eigenvalues Repeated Eigenvalues

Homogeneous Linear Systems Three Cases: Distinct Real Eigenvalues Repeated Eigenvalues Complex Eigenvalues MSW MTH 291 Distinct Eigenvalues General Solution-Homogeneous Systems Let 1 , 2 , . . . , n be n distinct real

264 views • 4 slides
Model Generation Method 2ai The Model Generation (MG) method is an easy method for humans to

Model Generation Method 2ai The Model Generation (MG) method is an easy method for humans to

Model Generation Method 2ai The Model Generation (MG) method is an easy method for humans to apply, but it has not been so widely implemented as DP. Similar to DP, MG returns True if given clauses are satisfiable . AUTOMATED REASONING MG

79 views • 7 slides
What are the different abodes of the soul? There are three separate and distinct domains or

What are the different abodes of the soul? There are three separate and distinct domains or

Difficult and Hard to Understand Passages What are the different abodes of the soul? There are three separate and distinct domains or abodes: 1. The earthly vessel where our souls now abide while we are living. 2. Hades (Greek) and

479 views • 26 slides
Security and Authorization Access to large databases is generally selective: Distinct users

Security and Authorization Access to large databases is generally selective: Distinct users

Security and Authorization Access to large databases is generally selective: Distinct users have distinct privileges. The process of defining and granting these privileges is called authorization. Authorization is generally a positive

514 views • 22 slides
Sponsored by Thomson Reuters Housekeeping Todays webcast will last approximately one hour

Sponsored by Thomson Reuters Housekeeping Todays webcast will last approximately one hour

Tax Workflow Automation What You Need to Know for the Next Tax Period How to Put Tax Workflow Automation to Work in Your Firm Sponsored by Thomson Reuters Housekeeping Todays webcast will last approximately one hour There is

517 views • 25 slides
Weak memory models INF4140 - Models of concurrency Weak memory models Fall 2016 30. 10. 2016

Weak memory models INF4140 - Models of concurrency Weak memory models Fall 2016 30. 10. 2016

Weak memory models INF4140 - Models of concurrency Weak memory models Fall 2016 30. 10. 2016 Overview Weak memory models 1 Introduction 2 Hardware architectures Compiler optimizations Sequential consistency Weak memory models 3 TSO

1.3k views • 87 slides
Outline 0024 Spring 2010 9 :: 2 Reasoning about parallel programs 0024

Outline 0024 Spring 2010 9 :: 2 Reasoning about parallel programs 0024

Outline 0024 Spring 2010 9 :: 2 Reasoning about parallel programs 0024 Spring 2010 9 :: 3 Reasoning about parallel programs 0024 Spring 2010 9 :: 4 Example 0024 Spring 2010 9

1.15k views • 62 slides
Verifiedexec: An Introduction Brett Lymn Origins Idea formulated late last millenium A sudden

Verifiedexec: An Introduction Brett Lymn Origins Idea formulated late last millenium A sudden

Verifiedexec: An Introduction file:///home/user/blymn/presentations/veriexec/veriexec.html Verifiedexec: An Introduction Brett Lymn Origins Idea formulated late last millenium A sudden rise of trojans and root-kits Why should the kernel run

404 views • 4 slides
DESY Report Status and selected topics Joachim Mnich (DESY) Plenary ECFA Meeting 19 July 2018

DESY Report Status and selected topics Joachim Mnich (DESY) Plenary ECFA Meeting 19 July 2018

DESY Report Status and selected topics Joachim Mnich (DESY) Plenary ECFA Meeting 19 July 2018 The European XFEL entering routine user operation German The European XFEL Organised Since 2016: (KET) Germany Page 3 ECFA Plenary

631 views • 40 slides
TAPPING THE POTENTIAL FOR REDUCING WORK-RELATED ROAD DEATHS AND INJURIES 23 October 2017,

TAPPING THE POTENTIAL FOR REDUCING WORK-RELATED ROAD DEATHS AND INJURIES 23 October 2017,

TAPPING THE POTENTIAL FOR REDUCING WORK-RELATED ROAD DEATHS AND INJURIES 23 October 2017, Brussels #PIN2017 Deirdre Sinnott McFeat on behalf of Work Related Road Collisions Work related road deaths involve: Workers Occupational road

621 views • 22 slides
HA - A Development Experience Report Jeff Epstein Parallel Scientific Labs

HA - A Development Experience Report Jeff Epstein Parallel Scientific Labs

HA - A Development Experience Report Jeff Epstein Parallel Scientific Labs jeff.epstein@parsci.com Todays talk 1. What is HA? 2. How did we do it? 3. Haskell 4. Cloud Haskell 5. Distributed consensus 6. Debugging 1. What is HA? HA

229 views • 11 slides
Report from Panda DAQT and Frontend Workshop Sren Lange (for the DAQT Group) XXXIII Panda

Report from Panda DAQT and Frontend Workshop Sren Lange (for the DAQT Group) XXXIII Panda

Report from Panda DAQT and Frontend Workshop Sren Lange (for the DAQT Group) XXXIII Panda Collaboration Meeting 05/31+06/04, 2010 14+18 June 2010 Stockholm University All talks are online:

606 views • 43 slides

More recommend