Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOctober 2022
Video Monitoring Queries
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 34, Issue 10Oct. 2022, Pages 5023–5036https://doi.org/10.1109/TKDE.2020.3048606Recent advances in video processing utilizing deep learning primitives achieved breakthroughs in fundamental problems in video analysis such as frame classification and object detection enabling an array of new applications. In this paper we study the ...
- research-articleApril 2021
Answering Skyline Queries Over Incomplete Data With Crowdsourcing
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 33, Issue 4April 2021, Pages 1360–1374https://doi.org/10.1109/TKDE.2019.2946798Due to the pervasiveness of incomplete data, incomplete data queries are vital in a large number of real-life scenarios. Current models and approaches for incomplete data queries mainly rely on the machine power. In this paper, we study the problem of <...
- research-articleFebruary 2021
Generalizing the Pigeonhole Principle for Similarity Search in Hamming Space
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 33, Issue 2Feb. 2021, Pages 489–505https://doi.org/10.1109/TKDE.2019.2899597A distance search in Hamming space finds binary vectors whose Hamming distances are no more than a threshold from a query vector. It is a fundamental problem in many applications, such as image retrieval, near-duplicate Web page detection, and scientific ...
- research-articleApril 2019
Adaptive Distributed RDF Graph Fragmentation and Allocation based on Query Workload
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 31, Issue 4April 2019, Pages 670–685https://doi.org/10.1109/TKDE.2018.2841389As massive volumes of Resource Description Framework (RDF) data are growing, designing a distributed RDF database system to manage them is necessary. In designing this system, it is very common to partition the RDF data into some parts, called fragments,...
- research-articleJanuary 2019
A Hardware-Accelerated Solution for Hierarchical Index-Based Merge-Join
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 31, Issue 1Jan. 2019, Pages 91–104https://doi.org/10.1109/TKDE.2018.2822707Hardware acceleration through <italic>field programmable gate arrays (FPGAs)</italic> has recently become a technique of growing interest for many data-intensive applications. Join query is one of the most fundamental database query types useful in ...
-
- research-articleJanuary 2019
Platform-Independent Robust Query Processing
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 31, Issue 1Jan. 2019, Pages 17–31https://doi.org/10.1109/TKDE.2017.2664827To address the classical selectivity estimation problem for OLAP queries in relational databases, a radically different approach called <monospace>PlanBouquet</monospace> was recently proposed in <xref ref-type="bibr" rid="ref1"> [1]</xref> , wherein the ...
- research-articleNovember 2018
SLA Definition for Multi-Tenant DBMS and its Impact on Query Optimization
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 30, Issue 11Nov. 2018, Pages 2213–2226https://doi.org/10.1109/TKDE.2018.2817235In the cloud context, users are often called tenants. A cloud DBMS shared by many tenants is called a multi-tenant DBMS. The resource consolidation in such a DBMS allows the tenants to only pay for the resources that they consume, while providing the ...
- research-articleNovember 2018
Approximate Order-Sensitive <italic>k</italic>-NN Queries over Correlated High-Dimensional Data
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 30, Issue 11Nov. 2018, Pages 2037–2050https://doi.org/10.1109/TKDE.2018.2812153The <italic>k</italic> Nearest Neighbor (<italic>k</italic>-NN) query has been gaining more importance in extensive applications involving information retrieval, data mining, and databases. Specifically, in order to trade off accuracy for efficiency, ...
- research-articleJune 2018
Range Queries on Multi-Attribute Trajectories
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 30, Issue 6June 2018, Pages 1206–1211https://doi.org/10.1109/TKDE.2017.2787711Motivated by the trend of providing comprehensive knowledge about trajectory data, we study multi-attribute trajectories each of which contains a sequence of time-stamped locations and a set of characteristic attributes. This enriches the data ...
- research-articleAugust 2017
VISUAL: Simulation of Visual Subgraph Query Formulation to Enable Automated Performance Benchmarking
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 29, Issue 8Aug. 2017, Pages 1765–1778https://doi.org/10.1109/TKDE.2017.2690392Visual graph interfaces improve the usability of graph databases by making it easier for users to formulate queries. Recently, a variety of interactive query formulation-based techniques (e.g., blending of visual query construction and processing, visual ...
- research-articleJuly 2017
Human-Powered Data Cleaning for Probabilistic Reachability Queries on Uncertain Graphs
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 29, Issue 7July 2017, Pages 1452–1465https://doi.org/10.1109/TKDE.2017.2684166Uncertain graph models are widely used in real-world applications such as knowledge graphs and social networks. To capture the uncertainty, each edge in an uncertain graph is associated with an existential probability that signifies the likelihood of the ...
- research-articleJune 2017
SAP: Improving Continuous Top-K Queries Over Streaming Data
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 29, Issue 6June 2017, Pages 1310–1328https://doi.org/10.1109/TKDE.2017.2662236Continuous top- $k$ query over streaming data is a fundamental problem in database. In this paper, we focus on the sliding window scenario, where a continuous top- $k$ query returns the top- $k$ objects within each query window on the data stream. Existing ...
- research-articleMay 2017
An Efficient Indexing Method for Skyline Computations with Partially Ordered Domains
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 29, Issue 5May 2017, Pages 963–976https://doi.org/10.1109/TKDE.2017.2656906Efficient processing of skyline queries with partially ordered domains has been intensively addressed in recent years. To further reduce the query processing time to support high-responsive applications, the skyline queries that were previously ...
- research-articleApril 2017
gMark: Schema-Driven Generation of Graphs and Queries
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 29, Issue 4April 2017, Pages 856–869https://doi.org/10.1109/TKDE.2016.2633993Massive graph data sets are pervasive in contemporary application domains. Hence, graph database systems are becoming increasingly important. In the experimental study of these systems, it is vital that the research community has shared solutions for ...
- research-articleFebruary 2017
Query Reorganization Algorithms for Efficient Boolean Information Filtering
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 29, Issue 2February 2017, Pages 418–432https://doi.org/10.1109/TKDE.2016.2620140In the information filtering paradigm, clients subscribe to a server with continuous queries that express their information needs and get notified every time appropriate information is published. To perform this task in an efficient way, servers employ ...
- research-articleFebruary 2017
Efficient Pattern-Based Aggregation on Sequence Data
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 29, Issue 2February 2017, Pages 286–299https://doi.org/10.1109/TKDE.2016.2618856A Sequence OLAP (S-OLAP) system provides a platform on which pattern-based aggregate (PBA) queries on a sequence database are evaluated. In its simplest form, a PBA query consists of a pattern template $T$ and an aggregate function $F$ . A pattern template ...
- research-articleJanuary 2017
Efficient Sensitivity Analysis for Inequality Queries in Probabilistic Databases
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 29, Issue 1January 2017, Pages 86–99https://doi.org/10.1109/TKDE.2016.2613538In this paper, we study inequality query (IQ query) processing in tuple independent probabilistic databases, where IQ queries can be categorized into IQ-path, IQ-tree, and IQ-graph queries. We focus on two related issues for IQ queries. One issue is to ...
- research-articleNovember 2016
Incremental Query Processing on Big Data Streams
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 28, Issue 11November 2016, Pages 2998–3012https://doi.org/10.1109/TKDE.2016.2601103This paper addresses online query processing for large-scale, incremental data analysis on a distributed stream processing engine (DSPE). Our goal is to convert any SQL-like query to an incremental DSPE program automatically. In contrast to other ...
- research-articleNovember 2016
Finding Causality and Responsibility for Probabilistic Reverse Skyline Query Non-Answers
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 28, Issue 11November 2016, Pages 2974–2987https://doi.org/10.1109/TKDE.2016.2599869Causality and responsibility is an essential tool in the database community for providing intuitive explanations for answers/non-answers to queries. Causality denotes the causes for the answers/non-answers to queries, and responsibility represents the ...
- research-articleOctober 2016
The Moving Diversified Nearest Neighbor Query
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 28, Issue 10October 2016, Pages 2778–2792https://doi.org/10.1109/TKDE.2016.2593464As a major type of continuous spatial queries, the moving $k$ nearest neighbor ( $k$ NN) query has been studied extensively. However, most existing studies have focused on only the query efficiency. In this paper, we consider further the usability of the query ...