NDLI: An Efficient Data Structure for Lattice Operations

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Talamo, Maurizio Vocca, Paola
Copyright Year	1999
Abstract	In this paper, we consider the representation and management of an element set on which a lattice partial order relation is defined.In particular, let n be the element set size. We present an \nradn-space implicit data structure for performing the following set of basic operations:1. Test the presence of an order relation between two given elements, in constant time. 2. Find a path between two elements whenever one exists, in O(l) steps, where l is the path length. 3. Compute the successors and/or predecessors set of a given element, in O(h) steps, where h is the size of the returned set. 4. Given two elements, find all elements between them, in time O(k log d), where k is the size of the returned set and d is the maximum in-degree or out-degree in the transitive reduction of the order relation. 5. Given two elements, find the least common ancestor and/or the greatest common successor in $O(\sqrt{n})$-time. 6. Given k elements, find the least common ancestor and/or the greatest common successor in $O(\sqrt{n}+k \log n)$time. (Unless stated otherwise, all logarithms are to the base 2.) The preprocessing time is O(n2 ). Focusing on the first operation, representing the building-box for all the others, we derive an overall \nradn-space\,$\times$\,time bound which beats the order n2 bottleneck representing the present complexity for this problem. Moreover, we will show that the complexity bounds for the first three operations are optimal with respect to the worst case. Additionally, a stronger result can be derived. In particular, it is possible to represent a lattice in space $O(n\sqrt{t})$, where t is the minimum number of disjoint chains which partition the element set.
Starting Page	1783
Ending Page	1805
Page Count	23
File Format	PDF
ISSN	00975397
DOI	10.1137/S0097539794274404
e-ISSN	10957111
Journal	SIAM Journal on Computing (SMJCAT)
Issue Number	5
Volume Number	28
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2006-07-28
Access Restriction	Subscribed
Subject Keyword	least common ancestors Data encryption graph decomposition data structure Data structures Graph theory reachability lattices
Content Type	Text
Resource Type	Article
Subject	Mathematics Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in