15. The method for implementing a skyline query of claim 14 , wherein the data comprise at least one attribute having ordered values, the processor determines a leaf node of the quad tree, to which the data will belong, by splitting a space, which has the number of the attributes of the data indicated by the criteria contained in the skyline query as a dimension, once or more according to location of points represented by the data in the space, and the leaf node of the quad tree comprises data, which are smaller than or the same in number as a split threshold.
15. The method for implementing a skyline query of claim 14 , wherein the data comprise at least one attribute having ordered values, the processor determines a leaf node of the quad tree, to which the data will belong, by splitting a space, which has the number of the attributes of the data indicated by the criteria contained in the skyline query as a dimension, once or more according to location of points represented by the data in the space, and the leaf node of the quad tree comprises data, which are smaller than or the same in number as a split threshold. 16. The method for implementing a skyline query of claim 15 , wherein the processor assigns a fixed ID to each of the split spaces for every space split according to location of each of the split spaces in the space prior to the split, and connects an ID of the space prior to the split and an ID of the split spaces to determine an ID of a node of a quad tree represented by the split spaces, and assigns a bit string, which has the same length as the dimension of the space, as an ID of each of the split spaces.