Efficient and scalable continuous skyline monitoring in two-tier streaming settings

Two-tier streaming settings are a typical dynamic environment where continuous skylines represent an important semantic indicator for multiple attributes. To monitor skylines over the dynamic data in such settings, one needs to continuously update the skyline query results in order to reflect the new data values. This paper tackles the problem of continuous skyline monitoring on a central query server over dynamic data from multiple data sites. Simply sending the updates of tuple values to the server is cost-prohibitive. Therefore, we propose an approach that allows the central server to collaborate with the data sites to monitor the possible skyline changes. By doing so, the processing load is distributed over all the data sites instead of only on the central server. Furthermore, this collaborative approach minimizes the bandwidth consumption between the server and the data sites, which is often critical in a widely distributed environment such as a wide-area sensor network. We give theoretical upper bounds for the computation costs and communication costs of the proposed collaborative approach. We also conduct extensive experiments on both synthetic and real data sets. The experimental results demonstrate that our collaborative approach is efficient, scalable and well-balanced in terms of communication costs and computation costs.     

Optimizing XML queries: Bitmapped materialized views vs. indexes

Optimizing queries using materialized views has not been addressed adequately in the context of XML due to the many limitations associated with the definition and usability of materialized views in traditional XML query evaluation models.     

Efficient processing of probabilistic group subspace skyline queries in uncertain databases

Due to the pervasive data uncertainty in many real applications, efficient and effective query answering on uncertain data has recently gained much attention from the database community. In this paper, we propose a novel and important query in the context of uncertain databases, namely probabilistic group subspace skyline (PGSS) query, which is useful in applications like sensor data analysis. Specifically, a PGSS query retrieves those uncertain objects that are, with high confidence, not dynamically dominated by other objects, with respect to a group of query points in ad-hoc subspaces. In order to enable fast PGSS query answering, we propose effective pruning methods to reduce the PGSS search space, which are seamlessly integrated into an efficient PGSS query procedure. Furthermore, to achieve low query cost, we provide a cost model, in light of which uncertain data are pre-processed and indexed. Extensive experiments have been conducted to demonstrate the efficiency and effectiveness of our proposed approaches.     

Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching

Pivot-based algorithms are effective tools for proximity searching in metric spaces. They allow trading space overhead for number of distance evaluations performed at query time. With additional search structures (that pose extra space overhead) they can also reduce the amount of side computations. We introduce a new data structure, the Fixed Queries Array (FQA), whose novelties are (1) it permits sublinear extra CPU time without any extra data structure; (2) it permits trading number of pivots for their precision so as to make better use of the available memory. We show experimentally that the FQA is an efficient tool to search in metric spaces and that it compares favorably against other state of the art approaches. Its simplicity converts it into a simple yet effective tool for practitioners seeking for a black-box method to plug in their applications.     

Constructing Multilevel Metadata Networks for Sharing Dispersed and Transient Information in a Mobile Environment

An intelligent multi-user mechanism has been prototyped at the Information System Collaboratory of the Pennsylvania State University, which is capable of resolving global queries with differing and overlapping information needs, spatial scalability and temporal assumptions. The sources of information for this prototype are mechanical damage monitoring sensors embedded in equipment at plant sites, on-board ships or aircrafts, archived historical and diagnostic databases like those available through NALCOMIS (NAVMASSO document J-004 EM-001C, 1995) logistics and maintenance databases at depots, interactive electronic technical manuals stored in databases, dynamic models of damage, and models of operational performance. The concept-of-operation includes mobile access to this information by equipment maintainers on-board ships, aircrafts and other mobile platforms. Real-time interoperation of these system components and databases, under dynamic equipment operating conditions of thermo-mechanical and environmental stress, requires complex interactions of internal representations of sensor data, performance requirements, resources and equipment models, with rich semantics. To support such interactions, following the work of Bright, Hurson and Pakzad (Bright, Hurson, and Pakzad, Transactions on Database Systems, Vol. 19, No. 2, pp. 212–253, 1994) local schema terms of available data sources are organized as the leaf nodes in a semantic network of metadata. The physical nodes of the network are partitioned into a top-down multi-level search control structure of increasing precision and decreasing semantic aggregation. Each physical node supports search through all lower layers of metadata in connected tree configurations. The resulting multilayered semantic network is modeled as a Thesaurus of terms T and relationships R. A relationship in R may be crisp or fuzzy. The DTIC (Defense Technical Information Center) thesaurus for equipment maintenance was used as a starting point in this work. It was further enhanced by application specific terms and endowed with a distance function. This distance function is used to formulate user adaptable Graphic User Interfaces (GUI) for making quality of service tradeoffs in the resolution of global queries.Step-by-step construction of the thesaurus as a multilevel metadata network, its scalability, dynamic adaptation through usage, and tolerance of semantic imprecision in query resolution are discussed in this paper. Furthermore, performance metrology for evaluating quality of service in global query resolution is also developed (Phoha, in Proceedings of the NIST Workshop on Advancing Measurements and Testing for Information Technology, Gaithersburg, MD, Oct. 1998).This work was funded by DARPA for the past four years under grant DE-FC36-94G010064, for establishing a National Information Infrastructure Testbed for Electronic Commerce in equipment health monitoring, failure diagnosis and prognosis services.     

城市核心区设计:新加坡的亚洲经验

通过对中心区城市设计政策和建议的分析,讨论了在一个特定的历史脉络下,一个东亚现代城市其城市核心区如何转型、如何预见其未来、如何面对全球竞争以及如何走向可持续发展目标的城市发展模式。     

Using Information Retrieval techniques for supporting data mining

The classic two-stepped approach of the Apriori algorithm and its descendants, which consisted of finding all large itemsets and then using these itemsets to generate all association rules has worked well for certain categories of data. Nevertheless for many other data types this approach shows highly degraded performance and proves rather inefficient.

We argue that we need to search all the search space of candidate itemsets but rather let the database unveil its secrets as the customers use it. We propose a system that does not merely scan all possible combinations of the itemsets, but rather acts like a search engine specifically implemented for making recommendations to the customers using techniques borrowed from Information Retrieval.     

基于 Silverlight 的二三维联动 WebGIS 的设计与实现

目前二维、三维GIS各有优劣,WebGIS也愈发追求系统效率和界面表现力,本文结合二维、三维GIS的优势,提出一种基于Silverlight的城市级别的二三维联动WebGIS方案,明显提高了WebGIS的系统效率和界面表现力,并利用ArcGIS API for Silverlight以及Skyline TerraExplorer Pro,开发了天津市静海县二三维联动地下管线信息管理系统。     

CASS 软件在交叉口竖向设计高程放样中的运用

针对道路交叉口竖向设计施工放样网格点高程手工获取过程烦琐、效率及精度低下、容易出错等问题,在目前较为流行的地形地籍成图软件南方CASS环境中,利用Visual LISP语言编程进行二次开发,调用CASS 软件“查询指定点高程”的命令,实现了交叉口竖向设计施工放样网格点高程值的快速计算,达到了化繁为简、降低工作强度的目的,提高了获取数据的精度和效率。