作者: Dana L. Hoggart
DOI:
关键词:
摘要: In accordance with the present invention, a system and method for positioning data in database is provided which employs coarsening graph representing order to reduce computational complexity of determining an efficient partitioning. certain object-oriented databases embodying example, constructed each object corresponds vertex, affinities pairs objects correspond edges. The are assigned based on combination predefined access types associated collection statistical regarding actual patterns. Simpler graphs then iteratively produced by collapsing vertices into single successive until desired simplicity constructed; this partitioned, producing rough partitioning objects, can be refined.