The Complexity of Boolean Conjunctive Queries with Intersection Joins

Saved in:
Bibliographic Details
Published inProceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Format Conference Proceeding
LanguageEnglish
Online AccessGet full text
DOI10.1145/3517804.3524156

Cover

BookMark eNotz09LwzAYBvAc9KDTs9d8gc4kb9I2Ry1TJwMR5jmk6RsW6ZLSP85-eyfr6YHngQd-t-QqpoiEPHC25lyqR1C8KJlcgxKSq_yGbPYHpFU6di3-hnGmydPnlFq08dzG7ym6Mfwg_ZywDzjQUxgPdBtH7Ac8LynS9xTicEeuvW0HvF9yRb5eNvvqLdt9vG6rp11meQl5Jh00ToB3umHMQ16AaBjqoixqrXWZO8GFRPSqtsCZUkyoGhgI7gF02QCsCLv8TrGz88m2ren6cLT9bDgz_0KzCM0ihD_tYEnx
ContentType Conference Proceeding
DBID ADTOC
UNPAY
DOI 10.1145/3517804.3524156
DatabaseName Unpaywall for CDI: Periodical Content
Unpaywall
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID 10.1145/3517804.3524156
GroupedDBID ADTOC
UNPAY
ID FETCH-LOGICAL-a1836-4c3dc23fc9d00f36732d0e9787b99986c2124eef5ba31055025b30321f3398d33
IEDL.DBID UNPAY
IngestDate Sun Sep 07 11:01:02 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a1836-4c3dc23fc9d00f36732d0e9787b99986c2124eef5ba31055025b30321f3398d33
OpenAccessLink https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/3517804.3524156
ParticipantIDs unpaywall_primary_10_1145_3517804_3524156
PublicationTitle Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Score 1.8292029
SourceID unpaywall
SourceType Open Access Repository
Title The Complexity of Boolean Conjunctive Queries with Intersection Joins
URI https://dl.acm.org/doi/pdf/10.1145/3517804.3524156
UnpaywallVersion publishedVersion
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PS8MwFMfD3A7iRcWJikoOXjx0tkmTtkeVjTFwTHAwTyVJE1BrOmyLzL_el67-QLzsWkIpL7x833t97xOELpKQEV-wyONGaEhQKPGEIyNSHZNAxIHwm2LO3ZSP5-FkwRYdRL5mYbIc3vPa_MJ3Pr3MTAu0ZVeUBY6WM4CQwWUdW6jHGcTfXdSbT2fXjy2355-VO2i7tkuxehd5_ks8Rrvrgb6yYQ66npGXQV3Jgfr4Q2Tc7Lv2UP9nWA_PvmVoH3W0PUBD2H7sfN3xLqsVLgy-KYpcCwtP7TOImTvm8H3tOMcldtVY3BQHy6Y1y-JJ8WTLPpqPhg-3Y6-9McET4JrcCxXNFKFGJZnvG8ojSjJfQ6IYSQgEY65AqEKtDZOCupsxIeCRoGEkMJQmcUbpIerawuojhIkfccVlwJQwoWKJSPxQR8b1cQrJRXSMLr-Nmi7XZIx0PeXM0tYkaWuSkw3WnqJu9VbrM5D6Sp63e_sJQBWkGA
linkProvider Unpaywall
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PS8MwFMfD3A7iRcWJikoOXjx0tkmTtkeVjTFwTHAwTyVJE1BrOmyLzL_el67-QLzsWkIpL7x833t97xOELpKQEV-wyONGaEhQKPGEIyNSHZNAxIHwm2LO3ZSP5-FkwRYdRL5mYbIc3vPa_MJ3Pr3MTAu0ZVeUBY6WM4CQwWUdW6jHGcTfXdSbT2fXjy2355-VO2i7tkuxehd5_ks8Rrvrgb6yYQ66npGXQV3Jgfr4Q2Tc7Lv2UP9nWA_PvmVoH3W0PUBD2H7sfN3xLqsVLgy-KYpcCwtP7TOImTvm8H3tOMcldtVY3BQHy6Y1y-JJ8WTLPpqPhg-3Y6-9McET4JrcCxXNFKFGJZnvG8ojSjJfQ6IYSQgEY65AqEKtDZOCupsxIeCRoGEkMJQmcUbpIerawuojhIkfccVlwJQwoWKJSPxQR8b1cQrJRXSMLr-Nmi7XZIx0PeXM0tYkaWuSkw3WnqJu9VbrM5D6Sp63e_sJQBWkGA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+41st+ACM+SIGMOD-SIGACT-SIGAI+Symposium+on+Principles+of+Database+Systems&rft.atitle=The+Complexity+of+Boolean+Conjunctive+Queries+with+Intersection+Joins&rft_id=info:doi/10.1145%2F3517804.3524156&rft.externalDocID=10.1145%2F3517804.3524156