To clarify, the database can be any type RDBMS, NoSQL/BigTable. However, it must not employ any usual consistency measures such as locks, or synchronization, but the inconsistency-invincibility must come only from the schema, somehow.
Is this "known" to be possible or impossible? Could there be a particular, perhaps very atomic, and isolated, and somehow clever, organization of data in the schema, such that all inconsistency and race conditions are impossible under any transactions? Even trivial, or non-implementable examples are welcome!
Or is there some kind of database uncertainty principle that says you can't have "consistency" and "performance" in equal share?