Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Data exchange: on the complexity of answering queries with inequalities

From MaRDI portal
Publication:1041761
Jump to:navigation, search

DOI10.1016/j.ipl.2005.03.001zbMath1182.68074OpenAlexW2130133338MaRDI QIDQ1041761

Aleksander Mądry

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.03.001


zbMATH Keywords

computational complexityquery answeringdata exchangecertain answers


Mathematics Subject Classification ID

Database theory (68P15)


Related Items (4)

XML Schema Mappings ⋮ Query languages for data exchange: beyond unions of conjunctive queries ⋮ Data exchange and schema mappings in open and closed worlds ⋮ Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices



Cites Work

  • Unnamed Item


This page was built for publication: Data exchange: on the complexity of answering queries with inequalities

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1041761&oldid=13048256"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 23:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki