Opening Hour

Mon - Sun, 08:00 - 24:00

Call Us

+86-21-58386189

Evaluating Probabilistic Queries over Imprecise Data

Evaluating Probabilistic Queries over Imprecise Data

+

ABSTRACT Many applications employ sensors for monitoring entities suchastemperatureandwindspeed. Acentralizeddatabase tracks these entities to enable query processing. Due to continuous changes in these values and limited resources (, network bandwidth and battery power), it is often infeasible to store the exact values at all times.

24 Processing Data In a Cache Oracle Help Center

24 Processing Data In a Cache Oracle Help Center

+

Performing Targeted Processing. Coherence provides for the ability to execute an agent against an entry in any map of data managed by a data grid: (key, agent); In the case of partitioned data, the agent executes on the grid node that owns the data to execute against.

NPDB Guidebook, Chapter D: Queries, Overview

NPDB Guidebook, Chapter D: Queries, Overview

+

Chapter D: Queries. Overview. The NPDB is an information clearinghouse created by Congress with the primary goals of improving health care quality, protecting the public, and reducing health care fraud and abuse in the United States.

Merged aggregate nearest neighbor query processing in road ...

Merged aggregate nearest neighbor query processing in road ...

+

Aggregate nearest neighbor query, which returns a common interesting point that minimizes the aggregate distance for a given query point set, is one of the most important operations in spatial databases and their application domains.

Querying the Internet with PIER Berkeley Database Research

Querying the Internet with PIER Berkeley Database Research

+

database query processing with recent peertopeer networking technologies, and we provide a detailed performance study demonstrating the need for and feasibility of our design. Finally, we describe how our architecture and tradeoffs raise a number of new research questions, both architectural and algorithmic, that are ripe for further exploration.

Multisource Skyline Query Processing in Road Networks

Multisource Skyline Query Processing in Road Networks

+

Multisource Skyline Query Processing in Road Networks Ke Deng Xiaofang Zhou Heng Tao Shen University of Queensland {dengke, zxf, shenht} Abstract Skyline query processing has been investigated extensively in recent years, mostly for only one query reference point. An example of a singlesource skyline query is to

Designing a SuperPeer Network Stanford University

Designing a SuperPeer Network Stanford University

+

Abstract A superpeeris a node in a peertopeer network that operates both as a server to a set of clients, and as an equal in a network of superpeers. Superpeer networks strike a balance between the inherent efficiency of centralized search, and the autonomy, load balancing and robustness to attacks provided by distributed search.

mongodb,groupby,nested,aggregate,multiplecolumns ...

mongodb,groupby,nested,aggregate,multiplecolumns ...

+

mongodb,mongodbquery Are the changes done using the shell in mongodb permanent ? And how MongoDb detects the config file? I am stuck in setting Slow query logs in MongoDb. We have a command () to set profiling level. But how can we set profiling for all databases and how to set...

Clustering spatial networks for aggregate query processing ...

Clustering spatial networks for aggregate query processing ...

+

Mar 01, 2008· Abstract. In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query processing. For this purpose, different techniques based on the clustering graph model are proposed in .

10 Good Abstract Examples That Will Kickstart Your Brain

10 Good Abstract Examples That Will Kickstart Your Brain

+

The abstract: In the week before the start of classes, participants were given two surveys: one of expected college engagement, and the second of video game usage, including a measure of video game addiction. Results suggested that video game addiction is .

SampleClean: Fast and Reliable Analytics on Dirty Data

SampleClean: Fast and Reliable Analytics on Dirty Data

+

query processing. We applied the same principles to other domains with expensive data transformations such as Materialized View Maintenance and Machine Learning. In this article, we highlight three projects: SampleClean [45] 1: SampleClean estimates aggregate (sum, count, avg) queries using samples of .

Abstract

Abstract

+

Abstract Comets and the chondritic porous interplanetary dust particles (CP IDPs) that they shed in their comae are reservoirs of primitive solar nebula materials.

Query processing in locationbased social networks ...

Query processing in locationbased social networks ...

+

Abstract The widespread proliferation of locationacquisition techniques and GPSembedded mobile devices resulted in the generation of geotagged data at unprecedented scale and have essentially enhanced the user experience in locationbased services associated with social networks.

The EigenTrust Algorithm for Reputation Management in P2P ...

The EigenTrust Algorithm for Reputation Management in P2P ...

+

the sum of the ratings of the individual transactions that peer i has downloaded from peer j: sij = P trij. Equivalently, each peer i can store the number satisfactory transactions it has had with peer j, sat(i,j) and the number of unsatisfactory transactions it has had with peer j, unsat(i,j). Then, sij is defined: sij = sat(i,j) − unsat(i,j) (1)

Efficient Processing of Window Functions in Analytical SQL ...

Efficient Processing of Window Functions in Analytical SQL ...

+

Note that the or dering only affects window function processing but not necessarily the final order of the result. If no ordering is specified, the result of some window functions (, row number) is nondeterministic. order by partition by frame. Figure 1: Window .

Models and Techniques for Approximate Queries in OLAP ...

Models and Techniques for Approximate Queries in OLAP ...

+

As a consequence, providing fast, even if approximate, answers to aggregate queries has become a tight requirement to make DSSbased applications efficient, and, thus, has been addressed in research in the vest of the socalled approximate query answering (AQA) techniques.