Skip to main content
added 19 characters in body
Source Link
Vérace
  • 30.6k
  • 9
  • 71
  • 84

This is a follow up question to Is Postgres ideal for Many to Many data (M:N) which keeps increasing?

To give an overview, Events and Participants are the main entities. There are 1000 events and 10M participants for each event.

Query : In Event_Participant_Table, Get Participants who registered for an event

The table contains 1000 * 10M records.

Do we need to search all 1000 * 10M records and how efficiently can we partition this in PostgreSQL as previously the query is per defined eventId.

Postgres : 12+

This is a follow up question to Is Postgres ideal for data which keeps increasing?

To give an overview, Events and Participants are the main entities. There are 1000 events and 10M participants for each event.

Query : In Event_Participant_Table, Get Participants who registered for an event

The table contains 1000 * 10M records.

Do we need to search all 1000 * 10M records and how efficiently can we partition this in PostgreSQL as previously the query is per defined eventId.

Postgres : 12+

This is a follow up question to Is Postgres ideal for Many to Many data (M:N) which keeps increasing?

To give an overview, Events and Participants are the main entities. There are 1000 events and 10M participants for each event.

Query : In Event_Participant_Table, Get Participants who registered for an event

The table contains 1000 * 10M records.

Do we need to search all 1000 * 10M records and how efficiently can we partition this in PostgreSQL as previously the query is per defined eventId.

Postgres : 12+

deleted 4 characters in body; edited title
Source Link
Vérace
  • 30.6k
  • 9
  • 71
  • 84

Efficient partitioning forof data which is Many-Many (M:N) in PostgresPostgreSQL

This is a follow up question to Is Postgres ideal for data(hierarchical) which keeps increasing?

To give an overview, Events and Participants are the main entities. There are 1000 events and 10M participants for each event.

Query : In Event_Participant_Table, Get Participants who registered for an event

The table contains 1000 * 10M records.

Do we need to search all 1000 * 10M records and how efficiently we can we partition this in PostgresPostgreSQL as alwayspreviously the query is per defined eventId.

Postgres : 12+

Efficient partitioning for data which is Many-Many in Postgres

This is a follow up question to Is Postgres ideal for data(hierarchical) which keeps increasing?

To give an overview, Events and Participants are main entities. There are 1000 events and 10M participants for each event.

Query : In Event_Participant_Table, Get Participants who registered for an event

The table contains 1000 * 10M records.

Do we need to search all 1000 * 10M records and how efficiently we can partition this in Postgres as always the query is per defined eventId.

Postgres : 12+

Efficient partitioning of data which is Many-Many (M:N) in PostgreSQL

This is a follow up question to Is Postgres ideal for data which keeps increasing?

To give an overview, Events and Participants are the main entities. There are 1000 events and 10M participants for each event.

Query : In Event_Participant_Table, Get Participants who registered for an event

The table contains 1000 * 10M records.

Do we need to search all 1000 * 10M records and how efficiently can we partition this in PostgreSQL as previously the query is per defined eventId.

Postgres : 12+

edited title
Link
Ayyappa
  • 203
  • 1
  • 7

Efficient partitioning for data which is hierarchicalMany-Many in Postgres

Source Link
Ayyappa
  • 203
  • 1
  • 7
Loading