8,320 Hits in 5.5 sec

FAQ: A Framework for Fast Approximate Query Processing on Temporal Data

Udayan Khurana, Srinivasan Parthasarathy, Deepak S. Turaga
2014 Knowledge Discovery and Data Mining  
Temporal queries on time evolving data are at the heart of a broad range of business and network intelligence applications ranging from consumer behavior analysis, trend analysis, temporal pattern mining  ...  In this work, we present an innovative data structure called Fast Approximate Query-able(FAQ), which provides a unified framework for temporal query processing on Big Data.  ...  We are interested in efficiently answering a wide variety of temporal aggregation, similarity and distance queries, including but not limited to distinct counts, set membership, frequency counts, top-K  ... 
dblp:conf/kdd/KhuranaPT14 fatcat:bi6xxr6sf5dkzjbgvifc3xpwm4

Keyword Search over Dynamic Categorized Information

Manish Bhide, Venkatesan T. Chakaravarthy, Krithi Ramamritham, Prasan Roy
2009 Proceedings / International Conference on Data Engineering  
Given a query, CS* finds the top-K categories with high accuracy even in time-constrained situations.  ...  In this paper, we describe a system, CS*, which takes a keyword query and returns the relevant top-K categories.  ...  Another challenge is to efficiently find the top-K answers in terms of running time. We have developed an innovative two-level threshold algorithm for this purpose, described in Section V.  ... 
doi:10.1109/icde.2009.91 dblp:conf/icde/BhideCRR09 fatcat:qscg5iw6hndhjavwhlamzu4bfu

A Unified Index for Spatio-Temporal Keyword Queries

Tuan-Anh Hoang-Vu, Huy T. Vo, Juliana Freire
2016 Proceedings of the 25th ACM International on Conference on Information and Knowledge Management - CIKM '16  
We propose a new indexing strategy that uniformly handles text, space and time in a single structure, and is thus able to efficiently evaluate queries that combine keywords with spatial and temporal constraints  ...  Efficiently evaluating queries over these data is challenging. Previous approaches have focused on the spatial aspect.  ...  This work was supported in part by NSF award CNS-1229185 and DARPA award FA8750-14-2-023.  ... 
doi:10.1145/2983323.2983751 dblp:conf/cikm/Hoang-VuVF16 fatcat:zgoc32juwzejda7dyoxjdqpzoy

Spatio-temporal top-k term search over sliding window

Lisi Chen, Shuo Shang, Bin Yao, Kai Zheng
2018 World wide web (Bussum)  
Specifically, given a query location and a set of geo-tagged messages within a sliding window, we study the problem of searching for the top-k terms by considering term frequency, spatial proximity, and  ...  In this paper, we present novel indexing, updating, and query processing techniques that are capable of discovering topk most frequent nearby terms over a sliding window.  ...  Based on the user requirements, we consider two kinds of top-k term query, Location-based Top-k Term Query (LkTQ) and Spatio-Temporal Top-k Term Query (STkTQ).  ... 
doi:10.1007/s11280-018-0606-x fatcat:bqthhmo3hfaf3onnfysko2e2ja

On clustering and retrieval of video shots through temporal slices analysis

Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang
2002 IEEE transactions on multimedia  
Each cluster in the top level contains shots with similar color while each cluster in bottom level consists of shots with similar motion.  ...  In this paper, we first demonstrate that tensor histogram features extracted from temporal slices are suitable for motion retrieval.  ...  This shot is different from others in terms of color and content. To test the retrieval performance, a query set which consists of 53 queries are manually picked and checked to have good answers.  ... 
doi:10.1109/tmm.2002.802022 fatcat:zvuowrweuncklmdybfx5djog6u

Location-Based Top-k Term Querying over Sliding Window [chapter]

Ying Xu, Lisi Chen, Bin Yao, Shuo Shang, Shunzhi Zhu, Kai Zheng, Fang Li
2017 Lecture Notes in Computer Science  
In this paper, we present novel indexing, updating, and query processing techniques that are capable of discovering top-k locally popular nearby terms over a sliding window.  ...  Specifically, given a query location and a set of geo-tagged messages within a sliding window, we study the problem of searching for the top-k terms by considering both the term frequency and the proximities  ...  Skovsgaard [31] designs a framework supporting indexing, updating and query processing which are capable of return the top-k terms in posts in a user-specified spatio-temporal range.  ... 
doi:10.1007/978-3-319-68783-4_21 fatcat:yqjiux3uevclbex7wkpgebwg2m

Querying Geo-Textual Data

Gao Cong, Christian S. Jensen
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
regions of geo-textual objects, and queries that extract properties, e.g., topics and top-k frequent words, of the objects in regions.  ...  Motivated in part by these developments, the research community has been hard at work enabling the efficient computation of a variety of query functionality on geo-textual data, yielding a sizable body  ...  A top-k range query q = ρ, ψ, k returns up to k objects from D that are located in the query region ρ, now ranked according to their text relevance to ψ. 4.  ... 
doi:10.1145/2882903.2912572 dblp:conf/sigmod/CongJ16 fatcat:dyrffsyirvh3jk74mqb6qsos3m

Restricted natural language based querying of clinical databases

Leila Safari, Jon D. Patrick
2014 Journal of Biomedical Informatics  
A translation algorithm is proposed to translate the RNLQ of users to SQL queries based on a similarity-based Top-k algorithm which is used in the mapping process of CliniDAL.  ...  Results: It is easy to compose a RNLQ via CliniDAL's interface in which query terms are automatically mapped to the underlying data models of a Clinical Information System (CIS) with an accuracy of more  ...  of the term in the underlying CIS MAP_TYPE Indicates the mapping types including ER, EAV and XML MAP_ORDER Indicates the order of the mapping in top-k algorithm ATRIBUTE For medical entities which they  ... 
doi:10.1016/j.jbi.2014.07.012 pmid:25051402 fatcat:tfjulgkmjbbfdkcq4f6y3baazm

The Impacts of Structural Difference and Temporality of Tweets on Retrieval Effectiveness

Lifeng Jia, Clement Yu, Weiyi Meng
2013 ACM Transactions on Information Systems  
In the second phase, we first categorize queries into several types by exploring the temporal distributions of their top-retrieved tweets from the first phase; then we calculate the time-related relevance  ...  It contains two query terms "Phone" and "hack" in its message. The Web page of the URL in d 3 has no query terms.  ...  Specifically, given the top K tweets of a test query q , we categorize q into one of three classes by exploring the temporal distribution of the top K tweets via the estimated p value and the estimated  ... 
doi:10.1145/2500751 fatcat:nvevttmmwreytk4hg25yjoyhui

Predictive spatio-temporal queries

Abdeltawab M. Hendawi, Mohamed F. Mokbel
2012 Proceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems - MobiGIS '12  
In the last few years, one of the most exciting work on spatio-temporal data management is about predictive queries.  ...  Predictive queries over spatio-temporal data proved to be vital in many location-based services including traffic management, ride sharing, and advertising.  ...  Next, a Self-Tunable Spatio-Temporal B + -tree, termed ST 2 B-tree, is introduced [9] to handle frequent updates for objects locations.  ... 
doi:10.1145/2442810.2442828 dblp:conf/gis/HendawiM12a fatcat:jstmvcb44fhgtmkqawmdwq4jfu

SSTD: A Distributed System on Streaming Spatio-Textual Data

Yue Chen, Zhida Chen, Gao Cong, Ahmed R. Mahmood, Walid G. Aref
2020 Proceedings of the VLDB Endowment  
In this paper, we present SSTD (Streaming Spatio-Textual Data), a distributed in-memory system supporting both continuous and snapshot queries with spatial, textual, and temporal constraints over data  ...  partitioning method termed QT (Quad-Text) tree, that utilizes the joint distribution of queries and spatio-textual data to reduce query latency and enhance system throughput. (3) To achieve load balance  ...  The parameter r in range keyword query and top-k frequent term query can also be a circular region.  ... 
dblp:journals/pvldb/ChenCCMA20 fatcat:pg3kdz6lsjgl5ahkrvherzjbfm

BORA: Routing and Aggregation for Distributed Processing of Spatio-Temporal Range Queries

Goce Trajcevski, Hui Ding, Peter Scheuermann, Isabel F. Cruz
2007 2007 International Conference on Mobile Data Management  
This work tackles the problem of answer-aggregation for continuous spatio-temporal range queries in distributed settings.  ...  We demonstrate that, when a range query that spans over more than one cell needs to have its answer computed for a user located in a particular cell, by intelligently combining the transmission and the  ...  In conclusion, this paper presented an approach for efficient aggregation of the individual (local) answers for spatio-temporal range queries in distributed settings.  ... 
doi:10.1109/mdm.2007.15 dblp:conf/mdm/TrajcevskiDSC07 fatcat:yqfjlwiyljflxlttkty6fei4uq

Answering Event-Related Questions over Long-Term News Article Archives [chapter]

Jiexin Wang, Adam Jatowt, Michael Färber, Masatoshi Yoshikawa
2020 Lecture Notes in Computer Science  
In addition, they usually exhibit strong temporal aspects and can be roughly categorized into two types: (1) ones containing explicit temporal expressions, and (2) ones only implicitly associated with  ...  To make better use of such heritage collections, this work considers the task of large scale question answering on long-term news article archives. Questions on such archives are often eventrelated.  ...  timestamps, temporal information embedded in document content and query time scope.  ... 
doi:10.1007/978-3-030-45439-5_51 fatcat:i4t6zxhfyffflmcimch3ro7zcq

The Indiana Center for Database Systems at Purdue University

Mourad Ouzzani, Sunil Prabhakar, Jeffrey S. Vitter, Xiang Zhang, Walid G. Aref, Elisa Bertino, Ann Christine Catlin, Christopher W. Clifton, Wing-Kai Hon, Ahmed K. Elmagarmid, Arif Ghafoor, Susanne E. Hambrusch
2005 SIGMOD record  
Top-k Query Processing Ranking queries produce results that are ordered on some computed score. Typically, in these queries, users are usually interested only in the top-k results.  ...  In particular, we propose efficient algorithms to enhance the performance of nearest-neighbor queries, range queries, and joins.  ... 
doi:10.1145/1083784.1083795 fatcat:lblzmkuu6vggznk4r44hm5z2oa

Towards location-based social networking services

Chi-Yin Chow, Jie Bao, Mohamed F. Mokbel
2010 Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Location Based Social Networks - LBSN '10  
In general, we discuss the challenges in designing location-and/or rank-aware query operators, materializing query answers, supporting continuous query processing, and providing privacy-aware query processing  ...  In GeoSocialDB, we aim to implement these services as query operators inside a database engine to optimize the query processing performance.  ...  querying user's object ratings. (3) Finally, a selection step selects the top-k objects in terms of the recommendation scores computed in the prediction step and recommends them to the querying user.  ... 
doi:10.1145/1867699.1867706 dblp:conf/gis/ChowBM10 fatcat:3ulxrf7zifgurjzxvkacrago3y
« Previous Showing results 1 — 15 out of 8,320 results