Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- keynoteJune 2021
INODE - Intelligence Open Data Exploration
SNTA '21: Proceedings of the 2021 on Systems and Network Telemetry and AnalyticsPages 1–2https://doi.org/10.1145/3452411.3464448This article describes the keynote speech on INODE presented at Fourth International Workshop on Systems and Network Telemetry and Analytics (SNTA) which is collocated with International ACM Symposium on High-Performance Parallel and Distributed ...
- research-articleJune 2012
Efficient Extended Boolean Retrieval
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 24, Issue 6Pages 1014–1024https://doi.org/10.1109/TKDE.2011.63Extended Boolean retrieval (EBR) models were proposed nearly three decades ago, but have had little practical impact, despite their significant advantages compared to either ranked keyword or pure Boolean retrieval. In particular, EBR models produce ...
- research-articleJanuary 2012
Labeling Dynamic XML Documents: An Order-Centric Approach
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 24, Issue 1Pages 100–113https://doi.org/10.1109/TKDE.2010.221Dynamic XML labeling schemes have important applications in XML Database Management Systems. In this paper, we explore dynamic XML labeling schemes from a novel order-centric perspective. We compare the various labeling schemes proposed in the ...
- research-articleDecember 2011
On Producing High and Early Result Throughput in Multijoin Query Plans
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 23, Issue 12Pages 1888–1902https://doi.org/10.1109/TKDE.2010.182This paper introduces an efficient framework for producing high and early result throughput in multijoin query plans. While most previous research focuses on optimizing for cases involving a single join operator, this work takes a radical step by ...
- research-articleSeptember 2011
MAP-JOIN-REDUCE: Toward Scalable and Efficient Data Analysis on Large Clusters
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 23, Issue 9Pages 1299–1311Data analysis is an important functionality in cloud computing which allows a huge amount of data to be processed over very large clusters. MapReduce is recognized as a popular way to handle data in the cloud environment due to its excellent scalability ...
-
- research-articleAugust 2011
Making Aggregation Work in Uncertain and Probabilistic Databases
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 23, Issue 8Pages 1261–1273https://doi.org/10.1109/TKDE.2010.166We describe how aggregation is handled in the Trio system for uncertain and probabilistic data. Because “exact” aggregation in uncertain databases can produce exponentially sized results, we provide three alternatives: a low bound on the aggregate value,...
- articleJuly 2011
myOLAP: An Approach to Express and Evaluate OLAP Preferences
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 23, Issue 7Pages 1050–1064https://doi.org/10.1109/TKDE.2010.196Multidimensional databases are the core of business intelligence systems. Their users express complex OLAP queries, often returning large volumes of facts, sometimes providing little or no information. Thus, expressing preferences could be highly ...
- research-articleAugust 2010
Query Processing Using Distance Oracles for Spatial Networks
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 22, Issue 8Pages 1158–1175https://doi.org/10.1109/TKDE.2010.75The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding shortest paths and finding nearest neighbors. The challenge here is that ...
- research-articleAugust 2010
Maintaining Recursive Views of Regions and Connectivity in Networks
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 22, Issue 8Pages 1126–1141https://doi.org/10.1109/TKDE.2010.65The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguous regions, declarative networks that maintain shortest paths, and distributed ...
- research-articleMay 2010
Incremental Evaluation of Visible Nearest Neighbor Queries
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 22, Issue 5Pages 665–681https://doi.org/10.1109/TKDE.2009.158In many applications involving spatial objects, we are only interested in objects that are directly visible from query points. In this paper, we formulate the visible k nearest neighbor (VkNN) query and present incremental algorithms as a solution, with ...
- research-articleMay 2010
Incremental Maintenance of 2-Hop Labeling of Large Graphs
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 22, Issue 5Pages 682–698https://doi.org/10.1109/TKDE.2009.117Recent interests on xml, the Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the reachability test of nodes. Recently, 2-hop labeling has been proposed ...
- research-articleOctober 2009
A Distributed Stream Query Optimization Framework through Integrated Planning and Deployment
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 20, Issue 10Pages 1439–1453https://doi.org/10.1109/TPDS.2008.232This paper addresses the problem of optimizing multiple distributed stream queries that are executing simultaneously in distributed data stream systems. We argue that the static query optimization approach of "plan, then deployment” is inadequate for ...
- research-articleOctober 2009
Exploiting Stream Request Locality to Improve Query Throughput of a Data Integration System
IEEE Transactions on Computers (ITCO), Volume 58, Issue 10Pages 1356–1368https://doi.org/10.1109/TC.2009.80This paper focuses on the problem of improving throughput of distributed query processing in an RDBMS-based data integration system. Although a buffer pool can be used in an RDBMS to cache disk pages in memory to reduce disk accesses, it cannot be used ...
- research-articleJuly 2009
Efficient Skyline Computation in Structured Peer-to-Peer Systems
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 21, Issue 7Pages 1059–1072https://doi.org/10.1109/TKDE.2008.235An increasing number of large-scale applications exploit peer-to-peer network architecture to provide highly scalable and flexible services. Among these applications, data management in peer-to-peer systems is one of the interesting domains. In this ...
- articleFebruary 2007
Query processing methods considering the deadline of queries for database broadcasting systems
In recent years, there has been an increasing interest in the database broadcasting system where the server periodically broadcasts contents of a database to mobile clients such as portable computers and PDAs. There are three query processing methods in ...
- research-articleNovember 2005
A Threshold-Based Algorithm for Continuous Monitoring of k Nearest Neighbors
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 17, Issue 11Pages 1451–1464https://doi.org/10.1109/TKDE.2005.172Assume a set of moving objects and a central server that monitors their positions over time, while processing continuous nearest neighbor queries from geographically distributed clients. In order to always report up-to-date results, the server could ...
- research-articleJanuary 2004
An Efficient and Scalable Algorithm for Clustering XML Documents by Structure
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 16, Issue 1Pages 82–96https://doi.org/10.1109/TKDE.2004.1264824Abstract--With the standardization of XML as an information exchange language over the net, a huge amount of information is formatted in XML documents. In order to analyze this information efficiently, decomposing the XML documents and storing them in ...
- ArticleFebruary 2002
Geometric-Similarity Retrieval in Large Image Bases
We propose a novel approach to shape-based image retrieval that builds upon a similarity criterion which is based on the average point set distance. Compared to traditional techniques, such as dimensionality reduction, our method exhibits better ...
- research-articleNovember 2000
Exploiting Spatial Indexes for Semijoin-Based Join Processing in Distributed Spatial Databases
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 12, Issue 6Pages 920–937https://doi.org/10.1109/69.895802In a distributed spatial database system, a user may issue a query that relates two spatial relations not stored at the same site. Because of the sheer volume and complexity of spatial data, spatial joins between two spatial relations at different sites ...
- research-articleNovember 1999
Automatic Text Categorization and Its Application to Text Retrieval
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 11, Issue 6Pages 865–879https://doi.org/10.1109/69.824599We develop an automatic text categorization approach and investigate its application to text retrieval. The categorization approach is derived from a combination of a learning paradigm known as instance-based learning and an advanced document retrieval ...