ADC
2008
Springer
13 years 10 months ago
2008
Springer
In this paper, we study the problem of measuring structural similarities of large number of source schemas against a single domain schema, which is useful for enhancing the qualit...
ADC
2008
Springer
13 years 10 months ago
2008
Springer
With respect to current methods for query evaluation over XML data streams, adoption of certain types of buffering techniques is unavoidable. Under lots of circumstances, the buff...
ADC
2008
Springer
13 years 10 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
ADC
2008
Springer
13 years 10 months ago
2008
Springer
Finding an appropriate data transformation between two schemas has been an important problem. In this paper, assuming that an edit script between original and updated DTDs is avai...
ADC
2008
Springer
13 years 10 months ago
2008
Springer
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
ADC
2008
Springer
13 years 10 months ago
2008
Springer
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...