Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Association for Computing Machinery (ACM)  (3)
  • Mathematik  (3)
Medientyp
Verlag/Herausgeber
  • Association for Computing Machinery (ACM)  (3)
Sprache
Erscheinungszeitraum
Fachgebiete(RVK)
  • Mathematik  (3)
RVK
  • 1
    Online-Ressource
    Online-Ressource
    Association for Computing Machinery (ACM) ; 2009
    In:  ACM Transactions on Database Systems Vol. 34, No. 1 ( 2009-04), p. 1-35
    In: ACM Transactions on Database Systems, Association for Computing Machinery (ACM), Vol. 34, No. 1 ( 2009-04), p. 1-35
    Kurzfassung: In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collect. An approach to this data management problem is the use of sensor database systems, which allow users to perform aggregation queries such as MIN, COUNT, and AVG on the readings of a sensor network. In addition, more advanced queries such as frequency counting and quantile estimation can be supported. Due to energy limitations in sensor-based networks, centralized data collection is generally impractical, so most systems use in-network aggregation to reduce network traffic. However, even these aggregation strategies remain bandwidth-intensive when combined with the fault-tolerant, multipath routing methods often used in these environments. To avoid this expense, we investigate the use of approximate in-network aggregation using small sketches. We present duplicate-insensitive sketching techniques that can be implemented efficiently on small sensor devices with limited hardware support and we analyze both their performance and accuracy. Finally, we present an experimental evaluation that validates the effectiveness of our methods.
    Materialart: Online-Ressource
    ISSN: 0362-5915 , 1557-4644
    RVK:
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 2009
    ZDB Id: 196155-X
    ZDB Id: 2006335-0
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Online-Ressource
    Online-Ressource
    Association for Computing Machinery (ACM) ; 2009
    In:  ACM Transactions on Database Systems Vol. 34, No. 3 ( 2009-08), p. 1-42
    In: ACM Transactions on Database Systems, Association for Computing Machinery (ACM), Vol. 34, No. 3 ( 2009-08), p. 1-42
    Kurzfassung: Due to the overwhelming flow of information in many data stream applications, data outsourcing is a natural and effective paradigm for individual businesses to address the issue of scale. In the standard data outsourcing model, the data owner outsources streaming data to one or more third-party servers, which answer queries posed by a potentially large number of clients on the data owner's behalf. Data outsourcing intrinsically raises issues of trust, making outsourced query assurance on data streams a problem with important practical implications. Existing solutions proposed in this model all build upon cryptographic primitives such as signatures and collision-resistant hash functions, which only work for certain types of queries, for example, simple selection/aggregation queries. In this article, we consider another common type of queries, namely, “GROUP BY, SUM” queries, which previous techniques fail to support. Our new solutions are not based on cryptographic primitives, but instead use algebraic and probabilistic techniques to compute a small synopsis on the true query result, which is then communicated to the client so as to verify the correctness of the query result returned by the server. The synopsis uses a constant amount of space irrespective of the result size, has an extremely small probability of failure, and can be maintained using no extra space when the query result changes as elements stream by. We then generalize our synopsis to allow some tolerance on the number of erroneous groups, in order to support semantic load shedding on the server. When the number of erroneous groups is indeed tolerable, the synopsis can be strengthened so that we can locate and even correct these errors. Finally, we implement our techniques and perform an empirical evaluation using live network traffic.
    Materialart: Online-Ressource
    ISSN: 0362-5915 , 1557-4644
    RVK:
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 2009
    ZDB Id: 196155-X
    ZDB Id: 2006335-0
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Online-Ressource
    Online-Ressource
    Association for Computing Machinery (ACM) ; 2019
    In:  ACM Transactions on Database Systems Vol. 44, No. 1 ( 2019-03-31), p. 1-41
    In: ACM Transactions on Database Systems, Association for Computing Machinery (ACM), Vol. 44, No. 1 ( 2019-03-31), p. 1-41
    Kurzfassung: Joins are expensive, and online aggregation over joins was proposed to mitigate the cost, which offers users a nice and flexible tradeoff between query efficiency and accuracy in a continuous, online fashion. However, the state-of-the-art approach, in both internal and external memory, is based on ripple join, which is still very expensive and even needs unrealistic assumptions (e.g., tuples in a table are stored in random order). This article proposes a new approach, the wander join algorithm, to the online aggregation problem by performing random walks over the underlying join graph. We also design an optimizer that chooses the optimal plan for conducting the random walks without having to collect any statistics a priori . Compared with ripple join, wander join is particularly efficient for equality joins involving multiple tables, but also supports θ-joins. Selection predicates and group-by clauses can be handled as well. To demonstrate the usefulness of wander join, we have designed and implemented XDB (approXimate DB) by integrating wander join into various systems including PostgreSQL, Spark, and a stand-alone plug-in version using PL/SQL. The design and implementation of XDB has demonstrated wander join’s practicality in a full-fledged database system. Extensive experiments using the TPC-H benchmark have demonstrated the superior performance of wander join over ripple join.
    Materialart: Online-Ressource
    ISSN: 0362-5915 , 1557-4644
    RVK:
    Sprache: Englisch
    Verlag: Association for Computing Machinery (ACM)
    Publikationsdatum: 2019
    ZDB Id: 196155-X
    ZDB Id: 2006335-0
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz