A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Distributed Evaluation of Top-k Temporal Joins
2016
Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16
Preserved Fulltext
We show how to exploit the nature of temporal predicates and the properties of their associated scoring semantics to design TKIJ , an efficient query evaluation approach on a distributed Map-Reduce architecture ...
RTJ queries are often best interpreted as top-k queries where only the best matches are returned. ...
TEMPORAL JOIN PROCESSING We present TKIJ, our approach for evaluating Top-K Interval Joins, that efficiently finds the set of k best results for an RTJ query Q. ...
doi:10.1145/2882903.2882912
dblp:conf/sigmod/PilourdaultLA16
fatcat:3lxydli6cbbdrjshwchjym35ea
ICDE conference 2014 table of contents
2014
2014 IEEE 30th International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Search
748
Top-k Preferences in High Dimensions
(Albert Yu, Pankaj K. ...
Jensen, Manohar Kaul, Shuo Shang)
Research Session 5: Keyword Search I -Spatial
148
Scalable Top-k Spatio-Temporal Term Querying
(Anders Skovsgaard, Darius Sidlauskas, Christian S. ...
doi:10.1109/icde.2014.6816625
fatcat:pm3vcptvmvb6pcjrbq75awpvtq
ICDE conference 2014 detailed author index
2014
2014 IEEE 30th International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Spatio-Temporal Term Querying C D E F G H I J K L M N O P Q R S T U V W X Y Z Tool for Internet-Scale Cardinality Estimation of XPath Queries Over Distributed Semistructured Data Song, Qiyue 1206 Trendspedia ...
L M N O P Q R S T U V W X Y Z
O
Olsen Jr., Paul W.
196
Efficient Top-k Closeness Centrality Search
Ooi, Beng Chin
40
R-Store: A Scalable Distributed System for Supporting Real-Time Analytics ...
doi:10.1109/icde.2014.6816627
fatcat:bmnfkwqucfcmhet64s2o6ns5ky
Query Processing Techniques for Big Spatial-Keyword Data
2017
Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The management of spatialkeyword data at this scale goes beyond the capabilities of centralized systems. ...
Finally, we conclude this tutorial with a discussion on some of the open problems and research directions in the area of big spatial-keyword query processing. ...
A subset of these queries has been answered in the big spatial-keyword domain, e.g, spatial-keyword filter [5, 43, 50, 51, 52] , top-k [36, 49, 68] , collective [30, 32] and join [76, 82] . ...
doi:10.1145/3035918.3054773
dblp:conf/sigmod/MahmoodA17
fatcat:h444z7zuazayhcjc2syjygz6mu
Scalable Microblogs Data Management
2016
Proceedings of the 2016 on SIGMOD'16 PhD Symposium - SIGMOD'16 PhD
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The distinguishing characteristics of microblogs have motivated a lot of research for managing such data. ...
To this end, the system is going to exploit and extend the infrastructure of Apache Spark system. ...
Thus, Kite is supporting ranking-aware query processing natively to evaluate top-k queries eff ciently. The importance of top-k queries comes from the excessive numbers of microblogs data. ...
doi:10.1145/2926693.2929898
dblp:conf/sigmod/Magdy16
fatcat:fh4m6f6oevhudhcf2smlhmigma
Timeline index
2013
Proceedings of the 2013 international conference on Management of data - SIGMOD '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we develop the Timeline Index as a novel, unified data structure that efficiently supports temporal operators such as temporal aggregation, time travel, and temporal joins. ...
On the academic side, a large number of algorithms and data structures have been proposed, but they often address a subset of these temporal operators only. ...
If the Top-K multiset is empty as a result of this deletion, it is rebuilt with the Top-K values from the (unsorted) vector of values that initially did not make it into the Top-K multiset. ...
doi:10.1145/2463676.2465293
dblp:conf/sigmod/KaufmannMVFKFM13
fatcat:2t4f66oo3jbg5hq6hqfe5ioo5a
DiStRDF: Distributed Spatio-temporal RDF Queries on Spark
2018
International Conference on Extending Database Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Hence, with respect to an application scenario which analyzes vast amount of spatio-temporal heterogeneous data, the task of efficiently evaluating spatio-temporal queries on RDF is crucial. ...
On top of it, we devise a set of query execution plans which exploit an 1D encoding scheme for improving the performance of our system. ...
Then, we evaluate each of the logical plans, using a fixed physical plan for the join operator (Sort Merge Join). ...
dblp:conf/edbt/NikitopoulosVDV18
fatcat:zan7b56nfbc6hmga4wuisupwfe
Keyword search in databases
2009
Proceedings of the 35th SIGMOD international conference on Management of data - SIGMOD '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
One is to generate a set of relational algebra expressions and evaluate every such expression using SQL on an RDBMS directly or in a middleware on top of an RDBMS indirectly. ...
In our approach, in the first reduction step, we prune tuples that do not participate in any results using SQL, and in the second join step, we process the relational algebra expressions using SQL over ...
It is important to note that BP is an algorithm to compute top-k connected trees by pushing the ranking connected trees into the CN evaluation with Tmax, and the cost saving of finding top-k is at the ...
doi:10.1145/1559845.1559917
dblp:conf/sigmod/QinYC09
fatcat:rdhjj6yehfb7npuj36kqravscq
Efficient Graph Models for Retrieving Top-k News Feeds from Ego Networks
2012
2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This can be formulated as the problem of retrieving the top-k news items out of the d-degree ego network of each given user, where the set of all users producing feeds is of size n, with n ≫ d ≫ k and ...
This makes retrieval of different top-k news feeds for thousands of users per second very inefficient in a large social network. ...
Thus, top-k join processing for keyword search can be considered different to our problem of retrieving top-k content items from one's ego network and in the temporal order of the content items. ...
doi:10.1109/socialcom-passat.2012.73
dblp:conf/socialcom/PickhardtGSSK12
fatcat:q66jj72irrgg5pctktn2qunfe4
KEYNOTE: Keyword Search by Node Selection for Text Retrieval on DHT-Based P2P Networks
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Simulated experimental evaluation with up to 8,000 nodes and over 600,000 real-world documents validates the practicality of the proposed system. ...
We first analyze the communication cost of document-join systems. ...
Finally, the global top-k documents are obtained by merging the local top-k documents from each of these L nodes. ...
doi:10.1007/11733836_57
fatcat:p7mu4dkdene7xhfjsgr22n2x7e
The threshold join algorithm for top-k queries in distributed sensor networks
2005
Proceedings of the 2nd international workshop on Data management for sensor networks - DMSN '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. ...
The objective of a top-k query is to find the k highest ranked answers to a user defined similarity function. ...
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. ...
doi:10.1145/1080885.1080896
dblp:conf/dmsn/Zeinalipour-YaztiVGKTVKS05
fatcat:z3p23k2bb5a5xf4yoimp7atnd4
Temporal models for microblogs
2012
Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
More specifically, we use the difference in the temporal distribution between the top retrieved documents and retweets. ...
Microblog services particularly focused on recent news and events so dealing with the temporal aspects of microblogs is essential for providing effective retrieval. ...
For example, in Figure 1 , we display the temporal distribution of relevant documents, top retrieved documents, and retweets (RT) for a TREC query "Mexico drug war". ...
doi:10.1145/2396761.2398674
dblp:conf/cikm/ChoiC12
fatcat:w4v2zrnbeng6vaghojjnqhwwmu
The Time Index: An Access Structure for Temporal Data
1990
Very Large Data Bases Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We also describe an algorithm for processing a commonly used temporal JOIN operation. ...
It supports the processing of the temporal WHEN operator and temporal aggregate functions efficiently. ...
5: Two-Level Combined Attribute/Time Index
Figure 6 : 6 Figure 6: Result of Temporal Join
value, and valid time [tl, t2] of the version; use the EMPLOYEE top-level index to locate the time index for ...
dblp:conf/vldb/ElmasriWK90
fatcat:ke6syyaag5h3zgvllbfubvvdim
Parallel trajectory similarity joins in spatial networks
2018
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We consider two cases of trajectory similarity joins (TS-Joins), including a threshold-based join (Tb-TS-Join) and a top-k TS-Join (k-TS-Join), where the objects are trajectories of vehicles moving in ...
In contrast, the k-TS-Join does not take a threshold as a parameter, and it returns the top-k most similar trajectory pairs from the two sets. ...
Definition: k-TS-Join Given sets P and Q of trajectories, the top-k trajectory similarity join (k-TS-Join) finds a set A of k most similar trajectory pairs from the two sets, i.e., |A| = k and ∀(τ i , ...
doi:10.1007/s00778-018-0502-0
fatcat:kyhx22zr6bbhphu4tsbdy2mexa
Recommendation of Short-Term Activity Sequences During Distributed Events
2017
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The evaluation of our approach on a dataset built over a cruise program shows an average improvement of 9.7% over the state-of-the-art. ...
Recently, the notion of a distributed event (e.g. festival or cruise) that gathers multiple competitive activities has appeared in the literature. ...
Temporal Influence: Another factor that might have an impact on users' decision on joining an activity is the temporal aspect, i.e. when an activity takes place. ...
doi:10.1016/j.procs.2017.05.154
fatcat:jq25wfkvdbd63ljlbrf26fvedm
« Previous
Showing results 1 — 15 out of 57,477 results