Sciweavers

327 search results - page 45 / 66
» XML Tree Structure Compression
Sort
View
IFSA
2007
Springer
133views Fuzzy Logic» more  IFSA 2007»
14 years 1 months ago
Fuzzy Tree Mining: Go Soft on Your Nodes
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
Federico Del Razo López, Anne Laurent, Pasc...
CIKM
2005
Springer
14 years 1 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu
FUN
2010
Springer
247views Algorithms» more  FUN 2010»
14 years 18 days ago
A Fun Application of Compact Data Structures to Indexing Geographic Data
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In t...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
14 years 1 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
DEXA
2007
Springer
154views Database» more  DEXA 2007»
14 years 2 months ago
Beyond Lazy XML Parsing
XML has become the standard format for data representation and exchange in domains ranging from Web to desktop applications. However, wide adoption of XML is hindered by inefficien...
Fernando Farfán, Vagelis Hristidis, Raju Ra...