( en | de | ru )

 

Disambiguation of "Li, Jianzhong"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Aggregation Algorithms for Compressed Data Warehouses.

, and . IEEE Trans. Knowl. Data Eng., 14 (3): 515-529 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jianzhong Lu

Jianzhong Qi

Jianzhong Song

Jianzhong Xia

Jianzhong Chen

 

Other publications of authors with the same name

Towards efficient top-k reliability search on uncertain graphs., , and . Knowl. Inf. Syst., 50 (3): 723-750 (2017)Efficient Aggregation Algorithms for Compressed Data Warehouses., and . IEEE Trans. Knowl. Data Eng., 14 (3): 515-529 (2002)Efficient Skyline Computation on Big Data., , , and . IEEE Trans. Knowl. Data Eng., 25 (11): 2521-2535 (2013)Design of the Mass Customization Strategy for Special Purpose Vehicles.. ICAIC (3), volume 226 of Communications in Computer and Information Science, page 558-564. Springer, (2011)Enhanced GPR Signal for Layered Media Time-Delay Estimation in Low-SNR Scenario., , , , , and . IEEE Geosci. Remote. Sens. Lett., 13 (3): 299-303 (2016)On the Complexity of Bounded Deletion Propagation., , , and . COCOA, volume 10043 of Lecture Notes in Computer Science, page 453-462. Springer, (2016)Optimal Data Dispatching Methods in Near-Line Tertiary Storage System., , and . WAIM, volume 3129 of Lecture Notes in Computer Science, page 690-695. Springer, (2004)Join Algorithm Using Multiple Replicas in Data Grid., , and . WAIM, volume 3739 of Lecture Notes in Computer Science, page 416-427. Springer, (2005)A Comparative Study of Replica Placement Strategies in Data Grids., , , , and . APWeb/WAIM Workshops, volume 4537 of Lecture Notes in Computer Science, page 135-143. Springer, (2007)Supporting early pruning in top-k query processing on massive data., , and . Inf. Process. Lett., 111 (11): 524-532 (2011)