Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
— Information extraction (IE) systems are trained to extract specific relations from text databases. Real-world applications often require that the output of multiple IE systems...
Alpa Jain, Panagiotis G. Ipeirotis, AnHai Doan, Lu...
In this paper, we design and evaluate alternative selection placement strategies for optimizing a very large number of continuous queries in an Internet environment. Two grouping ...
Jianjun Chen, David J. DeWitt, Jeffrey F. Naughton