Sciweavers

1381 search results - page 81 / 277
» Structural signatures for tree data structures
Sort
View
POPL
2007
ACM
15 years 10 months ago
Context logic as modal logic: completeness and parametric inexpressivity
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
15 years 10 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
ICDM
2003
IEEE
160views Data Mining» more  ICDM 2003»
15 years 3 months ago
Indexing and Mining Free Trees
Tree structures are used extensively in domains such as computational biology, pattern recognition, computer networks, and so on. In this paper, we present an indexing technique f...
Yun Chi, Yirong Yang, Richard R. Muntz
ICDE
2011
IEEE
274views Database» more  ICDE 2011»
14 years 1 months ago
Collaborative caching for spatial queries in Mobile P2P Networks
Abstract—We propose a novel collaborative caching framework to support spatial query processing in Mobile Peer-toPeer Networks (MP2PNs). To maximize cache sharing among clients, ...
Qijun Zhu, Dik Lun Lee, Wang-Chien Lee
ISAAC
2009
Springer
83views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Deletion without Rebalancing in Multiway Search Trees
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
Siddhartha Sen, Robert Endre Tarjan