Computer Science > Data Structures and Algorithms
[Submitted on 13 Sep 2021]
Title:Predictable universally unique identification of sequential events on complex objects
View PDFAbstract:Universal identifiers and hashing have been widely adopted in computer science from distributed financial transactions to data science. This is a consequence of their capability to avoid many shortcomings of relative identifiers, such as limited scope and the need for central management. However, the current identifiers in use are isolated entities which cannot provide much information about the relationship between objects. As an example, if one has both the identifiers of an object and its transformed version, no information about how they are related can be obtained without resorting to some kind of authority or additionally appended information. Moreover, given an input object and an arbitrarily long sequence of costly steps, one cannot currently predict the identifier of the outcome without actually processing the entire sequence. The capability of predicting the resulting identifier and avoiding redundant calculations is highly desirable in an efficient unmanaged system. In this paper, we propose a new kind of unique identifier that is calculated from the list of events that can produce an object, instead of directly identifying it by content. This provides an identification scheme regardless of the object's current existence, thus allowing to inexpensively check for its content in a database and retrieve it when it has already been calculated before. These identifiers are proposed in the context of abstract algebra, where objects are represented by elements that can be operated according to useful properties, such as associativity, order sensitivity when desired, and reversibility, while simplicity of implementation and strong guarantees are given by well known group theory results.
Submission history
From: Davi Pereira-Santos PhD [view email][v1] Mon, 13 Sep 2021 14:59:20 UTC (130 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
Connected Papers (What is Connected Papers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.