Advertisement

Data Stream Synopsis Using SaintEtiQ

  • Quang-Khai Pham
  • Noureddine Mouaddib
  • Guillaume Raschia
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4027)

Abstract

In this paper, a novel approach for building synopses is proposed by using a service and message-oriented architecture. The SaintEtiQ summarization system initially designed for very large stored databases, by its intrinsic features, is capable of dealing with the requirements inherent to the data stream environment. Its incremental maintenance of the output summaries and its scalability allows it to be a serious challenger to existing techniques. The resulting summaries present on the one hand the incoming data in a less precise form but is still on the other hand very informative on the actual content. We expose a novel way of exploiting this semantically rich information for query answering with an approach mid-way between blunt query answering and mid-way between data mining.

Keywords

Data Stream Timely Answer Error Tree Mobile Router Answer Quality 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
  2. 2.
    Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: Proc. of ACM Symposium on Principles of Database Systems 2002 (2002)Google Scholar
  3. 3.
    Babcock, B., Datar, M., Motwani, R.: Sampling from a moving window over streaming data. In: 2002 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002) (2002)Google Scholar
  4. 4.
    Babcock, B., Datar, M., Motwani, R.: Load shedding techniques for data stream systems. In: 20th International Conference on Data Engineering ICDE 2004 (2004)Google Scholar
  5. 5.
    Cormode, G., Muthukrishnan, S.: What’s hot and what’s not: Tracking most frequent items dynamically. In: Proc. of ACM Principles of Database Systems (PODS 2003), pp. 296–306 (2003)Google Scholar
  6. 6.
    Gibbons, P.B., Matias, Y.: Synopsis data structures for massive data sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1998)Google Scholar
  7. 7.
    Gilbert, A.C., Guha, S., Indyk, P., Kotidis, Y., Muthukrishnan, S., Strauss, M.J.: Fast, small-space algorithms for approximate histogram maintenance. In: STOC 2002 (2002)Google Scholar
  8. 8.
    Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: ACM SIGMOD 2001 (2001)Google Scholar
  9. 9.
    Karras, P., Mamoulis, N.: One-pass wavelet synopses for maximum-error metrics. In: Proc. of 31st VLDB Conference 2005 (2005)Google Scholar
  10. 10.
    Matias, Y., Vitter, J.S., Wang, M.: Wavelet-based histograms for selectivity estimation. In: Proc. of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD 1998), June 1998, pp. 448–459 (1998)Google Scholar
  11. 11.
    Motwani, R., Fang, M., Shivakumar, N., Garcia-Molina, H., Ullman, J.D.: Computing iceberg queries efficiently. In: Proc. of the 24th VLDB Conference 1998, pp. 299–310 (1998)Google Scholar
  12. 12.
    Motwani, R., Manku, G.S.: Approximate frequency counts over data streams. In: Proc. of the 28th VLDB Conference 2002 (2002)Google Scholar
  13. 13.
    Paik, H.-Y., Benatallah, B., Baïna, K., Toumani, F., Rey, C., Rutkowska, A., Harianto, B.: Ws-catalognet: An infrastructure for creating, peering, and querying e-catalog communities. In: Proc. of the 30th VLDB Conference 2004 (2004)Google Scholar
  14. 14.
    Poosala, V., Ioannisdis, Y.E., Haas, P.J., Shekita, E.J.: Improved histograms for selectivity estimation of range predicates. In: 22nd VLDB Conference 1996 (1996)Google Scholar
  15. 15.
    Saint-Paul, R., Raschia, G., Mouaddib, N.: General purpose dataset summarization. In: 31st VLDB Conference 2005 (2005)Google Scholar
  16. 16.
    Sun, A., Hassan, M., Hassan, M.B.I., Pham, P., Benatallah, B.: Fast and scalable access to advance resource reservation data in future mobile networks. IEEE ICC (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Quang-Khai Pham
    • 1
  • Noureddine Mouaddib
    • 1
  • Guillaume Raschia
    • 1
  1. 1.ATLAS-GRIM GroupLINA – Polytech’NantesNantesFrance

Personalised recommendations