| Summary: | 碩士 === 大葉大學 === 資訊工程學系碩士班 === 95 === The temporal data is widely utilized and studied. The researchers are interested in the storage management and indexing technique on this special type of data. XML is a newly developed data structure and exchange standard in recent years. Because of its flexible structure of the XML document and independent communication protocol, XML document is especially suitable for transmitting on the internet network and World Wide Web. Different from the traditional database management systems, the numerous characteristics of XML make the data easier to exchange and communicate. As a result, more data are stored in XML format.
If the temporal data stored in XML structure, searching data must check for each data of document, which results in high cost. For temporal data, the traditional indexing techniques considered only single attribute in data clustering, making it faster to retrieve data by the indexed attribute. However, the efficiency declines dramatically when the search criteria is not indexed.
In our research, we proposed a new data clustering method for improving comprehensive efficiency of data retrieval. By building the temporal data in the multidimensional matrix observes the relation among the data. Then, we try to cut matrix apart into a lot of blocks by considering all attributes and utilized the characteristics of greedy algorithm to improve the speed of the data clustering. By this approach, we can improve comprehensive efficiency of data retrieval.
|
|---|
