Thumbnail
Access Restriction
Subscribed

Author Brisaboa, N.R. ♦ de Bernardo, G. ♦ Navarro, G.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2012
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Navigation ♦ Radiation detectors ♦ Vegetation ♦ Data structures ♦ Indexes ♦ Resource description framework
Abstract We introduce a dynamic data structure for the compact representation of binary relations R ? A × B. Apart from checking whether two objects (a, b) ? A × B are related, and listing the objects of B related to some a ? A and vice versa, the structure allows inserting and deleting pairs (a, b) in the relation, as well as modifying the base sets A and B. The data structure is a dynamic variant of the k2-tree, a static compact representation that takes advantage of clustering in the binary relation to achieve compression. We apply our dynamic data structure to the representation of Web graphs and RDF databases, showing that it combines good compression ratios with fast query and update times.
ISBN 9781467307154
ISSN 10680314
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2012-04-10
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 222.98 kB
Page Count 10
Starting Page 52
Ending Page 61


Source: IEEE Xplore Digital Library