Sciweavers

688 search results - page 35 / 138
» Types for trees
Sort
View
123
Voted
ACMSE
2007
ACM
15 years 4 months ago
Exploring the duality between skip lists and binary search trees
Although skip lists were introduced as an alternative to balanced binary search trees (BSTs), we show that the skip list can be interpreted as a type of randomly-balanced BST whos...
Brian C. Dean, Zachary H. Jones
DEXA
2005
Springer
138views Database» more  DEXA 2005»
15 years 6 months ago
Full-Text and Structural XML Indexing on B+-Tree
XML query processing is one of the most active areas of database research. Although the main focus of past research has been the processing of structural XML queries, there are gro...
Toshiyuki Shimizu, Masatoshi Yoshikawa
POPL
2003
ACM
16 years 1 months ago
The essence of XML
The World-Wide Web Consortium (W3C) promotes XML and related standards, including XML Schema, XQuery, and XPath. This paper describes a formalization XML Schema. A formal semantic...
Jérôme Siméon, Philip Wadler
107
Voted
QUESTA
2008
96views more  QUESTA 2008»
15 years 6 days ago
Reduction of a polling network to a single node
We consider a discrete-time tree network of polling servers where all packets are routed to the same node (called node 0), from which they leave the network. All packets have unit...
Paul Beekhuizen, Dee Denteneer, Jacques Resing
WWW
2001
ACM
16 years 1 months ago
Batch rekeying for secure group communications
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
Xiaozhou (Steve) Li, Yang Richard Yang, Mohamed G....