Sciweavers

2834 search results - page 217 / 567
» Representing Trees with Constraints
Sort
View
84
Voted
WEBDB
2005
Springer
101views Database» more  WEBDB 2005»
15 years 6 months ago
T-SIX: An Indexing System for XML Siblings
We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling...
SungRan Cho
AC
2003
Springer
15 years 6 months ago
Generic Haskell: Applications
Generic Haskell is an extension of Haskell that supports the construction of generic programs. These lecture notes discuss three advanced generic programming applications: generic ...
Ralf Hinze, Johan Jeuring
103
Voted
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 4 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
15 years 4 months ago
An Efficient Index Lattice for XML Query Evaluation
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
Wilfred Ng, James Cheng
WWW
2010
ACM
15 years 4 months ago
Hierarchical cluster visualization in web mapping systems
This paper presents a technique for visualizing large spatial data sets in Web Mapping Systems (WMS). The technique creates a hierarchical clustering tree, which is subsequently u...
Jean-Yves Delort