5962 search results - page 1078 / 1193 » Efficient Clustering for Orders |
258
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
256
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
284
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
239
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
284
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...