Zhiyong Huang | Institute for Infocomm Research (original) (raw)

Zhiyong Huang

Zhiyong is Associate Professor (Practice) and Director of C-TReND for computing translational research and development. He teaches modules in 3D modeling and animation and programming methodology. His research area is computer graphics and human computer/robot interface. He had been working as a Senior Scientist in Institute for Infocomm Research, A*STAR since 2007, where he had served various roles including Senior Manager, Strategic Capability Development and Industry Development, Co-Principal Investigator, SERC Industrial Robotics Programme, Department Head, Computer Graphics and Interface, and Programme Manager of SERC Human Factor Engineering. Zhiyong is a Senior Member of ACM and IEEE, and a Pioneer Member of ACM SIGGRAPH and Chair of Singapore ACM SIGGRAPH Chapter.

less

Uploads

Papers by Zhiyong Huang

Proceedings of the ... AAAI Conference on Artificial Intelligence, Mar 24, 2024

Proceedings of the 13th annual ACM international workshop on Geographic information systems, 2005

Lecture Notes in Computer Science

Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)

11th Pacific Conference onComputer Graphics and Applications, 2003. Proceedings., 2003

Fundamentals of Computer Graphics, 1994

Proceedings Computer Graphics International, 2004.

ACM SIGMOD Record, 2006

Rapid advancements in positioning systems and wireless communications enable accurate tracking of... more Rapid advancements in positioning systems and wireless communications enable accurate tracking of continuously moving objects. This development poses new challenges to database technology since maintaining up-to-date information regarding the location of moving objects incurs an enormous amount of updates. There have been many efforts to address these challenges, most of which depend on the use of a minimum bounding rectangle (MBR) in a multi-dimensional index structure such as R-tree. The maintenance of MBRs causes lock contention and association of moving speeds with the MBRs cause large overlap between them. This problem becomes more severe as the number of concurrent operations increases. In this paper, we propose a "new" simple variant of the Buddy-tree, in which we enlarge the query rectangle to account for object movement rather than use an enlarged MBR. The result is not only elegant, but also efficient, particularly in terms of lock contention. An extensive experi...