Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleMarch 2009
iVA-File: Efficiently Indexing Sparse Wide Tables in Community Systems
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 210–221https://doi.org/10.1109/ICDE.2009.99In community web management systems (CWMS), storage structures inspired by universal tables are being used increasingly to manage sparse datasets. Such a sparse wide table (SWT) typically embodies thousands of attributes, with many of them being ...
- ArticleMarch 2009
BinRank: Scaling Dynamic Authority-Based Search Using Materialized SubGraphs
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 66–77https://doi.org/10.1109/ICDE.2009.94Dynamic authority-based keyword search algorithms, such as ObjectRank and personalized PageRank, leverage semantic link information to provide high quality, high recall search in databases and the Web. Conceptually, these algorithms require a query-time ...
- ArticleMarch 2009
Spatial Range Querying for Gaussian-Based Imprecise Query Objects
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 676–687https://doi.org/10.1109/ICDE.2009.93In sensor environments and moving robot applications, the position of an object is often known imprecisely because of measurement error and/or movement of the object. In this paper, we present query processing methods for spatial databases in which the ...
- ArticleMarch 2009
SbQA: A Self-Adaptable Query Allocation Process
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 1527–1530https://doi.org/10.1109/ICDE.2009.92We present a flexible query allocation framework, called Satisfaction-based Query Allocation (SbQA for short), for distributed information systems where both consumers and providers (the participants) have special interests towards queries. A ...
- ArticleMarch 2009
Minimizing Communication Cost in Distributed Multi-query Processing
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 772–783https://doi.org/10.1109/ICDE.2009.85Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in the area of distributed query processing and optimization. In this paper ...
-
- ArticleMarch 2009
Probabilistic Skyline Operator over Sliding Windows
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 1060–1071https://doi.org/10.1109/ICDE.2009.83Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of efficient processing of continuous skyline queries over sliding windows on uncertain data elements regarding given probability ...
- ArticleMarch 2009
Resolution-Aware Query Answering for Business Intelligence
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 976–987https://doi.org/10.1109/ICDE.2009.81Entity uncertainty is an unavoidable problem in modern enterprise databases, resulting from integration of data over multiple sources. In traditional warehousing, the administrator, during an ETL process, manually and laboriously resolves inconsistent ...
- ArticleMarch 2009
Efficient Distribution of Full-Fledged XQuery
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 565–576https://doi.org/10.1109/ICDE.2009.79We investigate techniques to automatically decompose any XQuery query into subqueries, that can be executed near their data sources; i.e., function-shipping. In this scenario, the subqueries being executed remotely may have XML node-valued parameters or ...
- ArticleMarch 2009
Keyword Search in Spatial Databases: Towards Searching by Document
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 688–699https://doi.org/10.1109/ICDE.2009.77This work addresses a novel spatial keyword query called the m-closest keywords (mCK) query. Given a database of spatial objects, each tuple is associated with some descriptive information represented in the form of keywords. The mCK query aims to find ...
- ArticleMarch 2009
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 305–316https://doi.org/10.1109/ICDE.2009.75When dealing with massive quantities of data, top-k queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring function. The problem of efficiently answering such ranking queries has been studied and ...
- ArticleMarch 2009
Histograms and Wavelets on Probabilistic Data
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 293–304https://doi.org/10.1109/ICDE.2009.74There is a growing realization that uncertain information is a first-class citizen in modern database management. As such, we need techniques to correctly and efficiently process uncertain data in database systems. In particular, data reduction ...
- ArticleMarch 2009
Online Interval Skyline Queries on Time Series
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 1036–1047https://doi.org/10.1109/ICDE.2009.70In many applications, we need to analyze a large number of time series. Segments of time series demonstrating dominating advantages over others are often of particular interest. In this paper, we advocate interval skyline queries, a novel type of time ...
- ArticleMarch 2009
Power Hints for Query Optimization
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 469–480https://doi.org/10.1109/ICDE.2009.68Commercial database systems expose query hints to address situations in which the optimizer chooses a poor plan for a given query. However, current query hints are not flexible enough to deal with a variety of non-trivial scenarios. In this paper, we ...
- ArticleMarch 2009
Querying Communities in Relational Databases
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 724–735https://doi.org/10.1109/ICDE.2009.67Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is specified by a set of l keywords, {k1, k2, · · · , kl}. It finds how the tuples that ...
- ArticleMarch 2009
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 1519–1522https://doi.org/10.1109/ICDE.2009.63This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region concept called the V*-Diagram. By incrementally maintaining the V*-...
- ArticleMarch 2009
Reverse Furthest Neighbors in Spatial Databases
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 664–675https://doi.org/10.1109/ICDE.2009.62Given a set of points $P$ and a query point $q$, the {\em reverse furthest neighbor} (\trfn) query fetches the set of points $p \in P$ such that $q$ is their furthest neighbor among all points in $P\cup\{q\}$. This is the monochromatic \trfn (\mrfn) ...
- ArticleMarch 2009
XBLEND: Visual XML Query Formulation Meets Query Processing
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 1535–1538https://doi.org/10.1109/ICDE.2009.57Due to the complexity of XML query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of XML to wider community. We present a RDBMS-based XML query evaluation system, called ...
- ArticleMarch 2009
Aggregate Query Answering under Uncertain Schema Mappings
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 940–951https://doi.org/10.1109/ICDE.2009.55Recent interest in managing uncertainty in data integration has led to the introduction of probabilistic schema mappings and the use of probabilistic methods to answer queries across multiple databases using two semantics: by-table and by-tuple. In this ...
- ArticleMarch 2009
KSpot: Effectively Monitoring the K Most Important Events in a Wireless Sensor Network
- Panayiotis Andreou,
- Demetrios Zeinalipour-Yazti,
- Martha Vassiliadou,
- Panos K. Chrysanthis,
- George Samaras
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 1503–1506https://doi.org/10.1109/ICDE.2009.54This demo presents a graphical user interface and ranking system, coined KSpot, for effectively monitoring the K highest-ranked answers to a query Q in a Wireless Sensor Network. KSpot deploys state-of-the-art distributed Top-k query processing ...
- ArticleMarch 2009
PLUS: A Message-Efficient Prototype for Location-Based Applications
ICDE '09: Proceedings of the 2009 IEEE International Conference on Data EngineeringMarch 2009, Pages 1515–1518https://doi.org/10.1109/ICDE.2009.48The PLUS system is designed to efficiently track moving object locations on a road network and execute continuous spatial queries in support of location-based services. PLUS implements a novel lazy position update mechanism that significantly reduces ...