DATA CLASSIFICATION SYSTEM AND METHOD FOR BUILDING CLASSIFICATION TREE FOR THE SAME
First Claim
1. A data classification system, comprising:
- a fetch unit, for receiving data including at least one datum, and fetching a data information contained in the data;
a classification tree module, for classifying the data in a manner of a tree structure according to the data information, and building a classification tree; and
a data repository, for storing the classification tree and the data.
1 Assignment
0 Petitions
Accused Products
Abstract
A data classification system is provided. The data classification system includes a fetch unit, a classification tree module, and a data repository. The fetch unit is adapted for receiving data including at least one datum, and fetching a data information contained in the data. The classification tree module is adapted for classifying the data in a manner of a tree structure according to the data information, and building a classification tree thereby. The data repository is adapted for storing the classification tree and the data. Therefore, the present invention provides a hierarchical structure which is adapted to accelerate a speed for searching data.
-
Citations
23 Claims
-
1. A data classification system, comprising:
-
a fetch unit, for receiving data including at least one datum, and fetching a data information contained in the data; a classification tree module, for classifying the data in a manner of a tree structure according to the data information, and building a classification tree; and a data repository, for storing the classification tree and the data. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A method for building the classification tree, comprising:
-
obtaining data including at least one datum, each of the data corresponding to a coordinate information; adding the data into a node; calculating a center position of the node according to the coordinate information corresponding to the data; calculating a distance of the coordinate information of each of the data to the center position, and obtaining a maximum distance; determining whether the maximum distance is greater than a predetermined distance; and dividing the node into a first sub-node and a second sub-node if the maximum distance is greater than a predetermined distance, and adding the data to one of the first sub-node and the second sub-node according to the coordinate information corresponding to each of the data. - View Dependent Claims (7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23)
-
Specification