—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
In today's Internet applications or sensor networks we often encounter large amounts of data spread over many physically distributed nodes. The sheer volume of the data and ba...
Ashwin Lall, Haiquan (Chuck) Zhao, Jun Xu, Mitsuno...
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
There are efforts underway to define each of several flavors of computing disciplines, including computer science, computer engineering, information science, information technolog...
Reza Kamali, Lillian N. Cassel, Richard J. LeBlanc