Sciweavers

409 search results - page 10 / 82
» Compact Similarity Joins
Sort
View
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
15 years 10 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
146
Voted
CIKM
2004
Springer
15 years 9 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
WIDM
2004
ACM
15 years 9 months ago
Ctree: a compact tree for indexing XML data
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
218
Voted
WWCA
1998
Springer
15 years 8 months ago
Compact and Flexible Resolution of CBT Multicast Key-Distribution
In an open network such as the Internet, multicast security services typically start with group session-key distribution. Considering scalability for group communication among wide...
Kanta Matsuura, Yuliang Zheng, Hideki Imai
146
Voted
AOSD
2003
ACM
15 years 9 months ago
A case for statically executable advice: checking the law of demeter with AspectJ
We define a generic join point model for checking the Law of Demeter (LoD). Join points are trees, pointcuts are predicates over join points, and advice is checked statically sim...
Karl J. Lieberherr, David H. Lorenz, Pengcheng Wu