Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-02-28
2006-02-28
Robinson, Greta (Department: 2167)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000
Reexamination Certificate
active
07007030
ABSTRACT:
A method of representing a dataset having a plurality of elements characterized by a plurality of relations, the method comprising the following steps. A first step includes, slicing at least a portion of the dataset into a plurality of slices, each of the slices comprises a portion of the plurality of elements. A second step includes, for each element of the plurality of elements, assigning a set of identifiers, each identifier of the set being characterized by a position within the set, the position representing one of the slices. A third step includes, for each element of the plurality of elements, assigning an interval, the interval representing at least one relation of the element to at least one element of the plurality of elements.
REFERENCES:
patent: 5488727 (1996-01-01), Agrawal et al.
patent: 5696973 (1997-12-01), Agrawal et al.
patent: 5696974 (1997-12-01), Agrawal et al.
patent: 6728728 (2004-04-01), Spiegler et al.
patent: 2002/0055929 (2002-05-01), Kolodner et al.
Gopal, Rajeev “Dynamic program slicing based on dependence relations”, Conference on Software Maintenance, 1991, 15-17, p. 191-200.
Kellogg S. Booth and George Lueker , Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms, Journal of Computer and System Sciences 13, 335-379(1976).
Bogdan Korel and Jrgen Rilling, Dynamic Program Slicing in Understanding of Program Execution, Department of Computer Science Illinois Institute of Technology, 1997, IEEE.
N. H. Cohen, Type-Extension Tests Can Be Performed in Constant Time, ACM Transactions on Programming Languages and Systems, vol. 13, No. 4, Oct. 1991, pp. 625-629.
J. Vitek, R. N. Horspool and A. Krall, Efficient Type Inclusion Tests, Proc. of the Object-Oriented Programming Languages, Systems and Applications, OOPSLA '97, Atlanta, Oct. 1997, pp. 1-16.
R. Agrawal, A. Borgida and H. V. Jagadish, Efficient Management of Transitive Relationships in Large Data and Knowledge Bases, pp. 253-262.
Gil Joseph
Zibin Yoav
Rayyan Susan
Robinson Greta
Technion Research & Development Foundation Ltd.
LandOfFree
Method of encoding a dataset does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method of encoding a dataset, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method of encoding a dataset will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3638137