Skip to Main Content Area
  • CPS-VO
    • Contact Support
  • Browse
    • Calendar
    • Announcements
    • Repositories
    • Groups
  • Search
    • Search for Content
    • Search for a Group
    • Search for People
    • Search for a Project
    • Tagcloud
      
 
Not a member?
Click here to register!
Forgot username or password?
 
Home
National Science Foundation

Cyber-Physical Systems Virtual Organization

Read-only archive of site from September 29, 2023.

CPS-VO

conjunctive queries

biblio

Visible to the public Deletion Propagation for Multiple Key Preserving Conjunctive Queries: Approximations and Complexity

Submitted by grigby1 on Fri, 07/10/2020 - 11:41am
  • query processing
  • multiple project-free
  • multiple queries
  • nontrivial set
  • polynomials
  • privacy
  • problem funda-mental
  • pubcrawl
  • quality management
  • query feedback
  • multiple key preserving conjunctive queries
  • realistic case
  • repairing data
  • Scalability
  • single query case
  • standard deletion propagation problem
  • tuples
  • view propagation
  • view side-effect
  • data lineage
  • Approximation algorithms
  • approximations
  • Complexity theory
  • computational complexity
  • computer science
  • conjunctive queries
  • conjunctive query
  • data cleaning
  • data deletion
  • approximation
  • Databases
  • debugging
  • deletion propagation
  • dichotomy
  • dynamic programming
  • Heuristic algorithms
  • investigated problem
  • key preserving

Terms of Use  |  ©2023. CPS-VO