A family of NP-complete data aggregation problems

DOI10.1007/BF00289148zbMATH Open0645.68025MaRDI QIDQ1103386FDOQ1103386

Authors: Paul Helman 

Publication date: 1989

Published in: Acta Informatica (Search for Journal in Brave)

Recommendations

• On the complexity of some data analysis problems
• On the complexity of designing optimal partial-match retrieval systems
• scientific article; zbMATH DE number 3923897
• NP-hard problems in hierarchical-tree clustering
• scientific article; zbMATH DE number 3921982

zbMATH Keywords

NP-completedata aggregationattribute partitioningdatabase design optimizationphysical optimization

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A record and file partitioning model
• Designing deductive databases
• Data base design techniques II: Physical structures and applications. Proceedings, Tokyo, November 1979

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: A family of NP-complete data aggregation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103386)