807 search results - page 97 / 162 » Space Efficient Algorithms for Ordered Tree Comparison |
213
Voted
VLDB
2005
ACM
16 years 3 months ago
2005
ACM
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, t...
147
Voted
KDD
2002
ACM
16 years 4 months ago
2002
ACM
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
148
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
Due to their capability for expressing semantics and relationships among data objects, semi-structured documents have become a common way of representing domain knowledge. Compari...
118
Voted
VLDB
1994
ACM
15 years 7 months ago
1994
ACM
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
129
Voted
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...