18845741
Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces
Many database applications require effective representation of regional objects in high-dimensional spaces. By applying an original query transformation, a recently proposed access method for regional data, called the simple QSF-tree (sQSF-tree), effectively attacks the limitations of traditional spatial access methods in spaces with many dimensions. Nevertheless, sQSF-trees are not immune to all problems associated with high data dimensionality. Based on the analysis of sQSF-trees, this paper presents a new variant of sQSF-trees, called the scalable QSF-tree (cQSF-tree), which relies on a heuristic optimization to reduce the number of false drops into pages that contain no object satisfying the query. By increasing the selectivity of search predicates, cQSF-trees improve the performance of multi-dimensional selections. Experimental evidence shows that cQSF-trees are more scalable than sQSF-trees to the growing data dimensionality. The performance improvements also increase with more skewed data distribution.
33931538
Dynamic Splitting Policies of the Adaptive 3DR-Tree for Indexing Continuously Moving Objects
Moving-objects databases need a spatio-temporal indexing scheme for moving objects to efficiently process queries over continuously changing locations of the objects. A simple extension of the R-tree that employs time as the third dimension of the data universe shows low space utilization and poor search performance because of overlapping index regions. In this paper, we propose a variant of the 3-dimensional R-tree called the Adaptive 3DR-tree. The dynamic splitting policies of the Adaptive 3DR-tree significantly reduce the overlap rate, and this, in turn, results in improved query performance. The results of our extensive experiments show that the Adaptive 3DR-tree outperforms the original 3D R-tree and the TB-tree typically by a big margin.
12972206
Interpolating and Using Most Likely Trajectories in Moving-Objects Databases
In recent years, many emerging database applications deal with large sets of continuously moving data objects. Since no computer system can commit continuously occurring infinitesimal changes to the database, related data management techniques view a moving object's trajectory as a sequence of discretely reported spatiotemporal points. For each pair of consecutive committed trajectory points, a spatiotemporal uncertainty region representing all possible in-between trajectory points is defined. To support trajectory queries with a non-uniform probability distribution model, the query system needs to compute (interpolate) the “most likely” trajectories in the uncertainty regions to determine the peak points of the probability distributions. This paper proposes a generalized trajectory interpolation model using parametric trajectory representations. In addition, the paper expands and investigates three practical specializations of our proposed model using a moving object with momentum, i.e., a vehicle, as the exemplar.
33239543
Implementing KDB-trees to support high-dimensional data
The problem of retrieving large volumes of high dimensional data is an important and timely issue in the area of database management. The guiding idea of the paper is to develop a general-purpose point access method that attacks the limitations of KDB-trees in high-dimensional spaces, while preserving their relatively good performance in low-dimensional situations. The proposed structure, called high-dimensional KDB-tree, eliminates downward propagation of splits associated with the original KDB-tree structure, which results in low storage utilization and rapid deterioration of the retrieval performance. Additional improvements in the storage and retrieval performance are achieved by removing certain redundant information from the interior nodes. Experimental results show that, in high-dimensional spaces, the proposed structure outperforms the original KDB-trees by a significant margin, while incurring no loss of performance in low-dimensional spaces. The structure also outperforms two other variants of KDB-trees investigated in the paper.
10366637
Inverted-space storage organization for persistent data of very high dimensionality
Contemporary database technology is severely limited in managing the high-dimensional data of many advanced applications, such as multimedia systems and data mining. The main concern of this paper is the well-known performance degradation of multi-dimensional access methods in spaces with many dimensions. The paper proposes an elaborate storage organization, called the inverted space, which can support efficient processing of data in spaces with very high dimensionality. The organization allows system administrators to control the size of spatial indexes and thereby to avoid the negative impact of extremely high data dimensionality on the retrieval performance. In addition, this paper introduces a new point access method designed to address numerous other problems that contemporary retrieval schemes experience in high-dimensional situations. This mechanism is envisioned to serve as the core indexing structure of inverted-space storage organizations.
6481584
An Efficient Zoning Technique for Multi-dimensional Access Methods
In emerging database applications that deal with large sets of multidimensional data, the performance of the query system significantly depends on the performance of its access methods and the underlying disk system. In recent years, hard disks are manufactured with multiple physical zones, where seek times and data transfer rates vary significantly across the zones. However, there is a marked lack of investigation on how to optimize multidimensional access methods given a zoned disk model. The paper proposes a novel dynamic zoning technique called DMD-Zoning that can be applied to a variety of multidimensional access methods and that can fully utilize zoning characteristics of hard disks for busy multi-user database systems.
970236
Pseudo likelihood estimation in network tomography
Network monitoring and diagnosis are key to improving network performance. The difficulties of performance monitoring lie in today's fast growing Internet, accompanied by increasingly heterogeneous and unregulated structures. Moreover, these tasks become even harder since one cannot rely on the collaboration of individual routers and servers to directly measure network traffic. Even though the aggregatory nature of possible network measurements gives rise to inverse problems, existing methods for solving inverse problems are usually computationally intractable or statistically inefficient. In this paper, a pseudo likelihood approach is proposed to solve a group of network tomography problems. The basic idea of pseudo likelihood is to form simple subproblems and construct a product of marginal likelihood of subproblems by the ignoring their dependences. As a result, it keeps a good balance between the computational complexity and the statistical efficiency of the parameter estimation. Some statistical properties of the pseudo likelihood estimator, such as consistency and asymptotic normality, are established. A pseudo expectation-maximization (EM) algorithm is developed to maximize the pseudo log-likelihood function. Two examples with simulated or real data are used to illustrate the pseudo likelihood proposal: (1) internal link delay distribution inference through multicast end-to-end measurements; (2) origin-destination matrix estimation through link traffic counts.
14231097
Distributed Reputation Management for Electronic Commerce
One of the major challenges for electronic commerce is how to establish a relationship of trust between different parties. Establishing trust is nontrivial, because the traditional physical or social means of trust cannot apply directly in virtual settings. In many cases, the parties involved may not ever have interacted before. Reputation systems seek to address the development of trust by recording the reputations of different parties. However, most existing reputation systems are restricted to individual market websites. Further, relevant information about a party may come from several websites and from interactions that were not mediated by any website. 
 
 
 
This paper considers the problem of automatically collecting ratings about a given party from others. Our approach involves a distributed agent architecture and adapts the mathematical theory of evidence to represent and propagate the ratings that participants give to each other. When evaluating the trustworthiness of a given party, a peer combines its local evidence (based on direct prior interactions with the party) with the testimonies of others regarding the same party. This approach satisfies certain important properties of distributed reputation management and is experimentally evaluated through simulations.
1757616
A scalable overlay video mixing service model
Figure 1. Information disparity over time and between streams
42772317
Density estimation by stochastic complexity
The results by P. Hall and E.J. Hannan (1988) on optimization of histogram density estimators with equal bin widths by minimization of the stochastic complexity are extended and sharpened in two separate ways. As the first contribution, two generalized histogram estimators are constructed. The first has unequal bin widths which, together with the number of the bins, are determined by minimization of the stochastic complexity using dynamic programming. The other estimator consists of a mixture of equal bin width estimators, each of which is defined by the associated stochastic complexity. As the main contribution in the present work, two theorems are proved, which together extend the universal coding theorems to a large class of data generating densities. The first gives an asymptotic upper bound for the code redundancy in the order of magnitude, achieved with a special predictive type of histogram estimator, which sharpens a related bound. The second theorem states that this bound cannot be improved upon by any code whatsoever. >
15189341
Wavelet thresholding for multiple noisy image copies
This correspondence addresses the recovery of an image from its multiple noisy copies. The standard method is to compute the weighted average of these copies. Since the wavelet thresholding technique has been shown to effectively denoise a single noisy copy, we consider in this paper combining the two operations of averaging and thresholding. Because thresholding is a nonlinear technique, averaging then thresholding or thresholding then averaging produce different estimators. By modeling the signal wavelet coefficients as Laplacian distributed and the noise as Gaussian, our investigation finds the optimal ordering to depend on the number of available copies and on the signal-to-noise ratio. We then propose thresholds that are nearly optimal under the assumed model for each ordering. With the optimal and near-optimal thresholds, the two methods yield similar performance, and both show considerable improvement over merely averaging.