231
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
250
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
247
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
LeSelect is a mediator system which allows scientists to publish their resources (data and programs) so they can be transparently accessed. The scientists can typically issue quer...
231
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
We propose to extend database systems by a Skyline operation. This operation filters out a set of interesting points from a potentially large set of data points. A point is intere...
259
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
High availability for both data and applications is rapidly becoming a business requirement. While database systems support recovery, providing high database availability, applica...
243
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
Spatial Joins are important and time consuming operations in spatial database management systems. It is crucial to be able to accurately estimate the performance of these operatio...
237
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
The timestamps of now-relative bitemporal databases are modeled as growing, shrinking, or rectangular regions. The shape of these regions makes it a challenge to design bitemporal...
243
click to vote
ICDE
2001
IEEE
16 years 6 months ago
2001
IEEE
Many scientific disciplines are shifting from in vitro to in silico research as more physical processes and natural phenomena are examined in a computer (in silico) instead of bei...