Sciweavers

1286 search results - page 229 / 258
» Scalable Package Queries in Relational Database Systems
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
15 years 9 months ago
Evaluating rank joins with optimal cost
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...
Karl Schnaitter, Neoklis Polyzotis
WWW
2008
ACM
15 years 10 months ago
Scaling RDF with time
The World Wide Web Consortium's RDF standard primarily consists of (subject,property,object) triples that specify the value that a given subject has for a given property. How...
Andrea Pugliese, Octavian Udrea, V. S. Subrahmania...
CIKM
1998
Springer
15 years 1 months ago
Supporting Fast Search in Time Series for Movement Patterns in Multiple Scales
An important investigation of time series involves searching for \movement" patterns, such as \going up" or \going down" or some combinations of them. Movement patt...
Yunyao Qu, Changzhou Wang, Xiaoyang Sean Wang
70
Voted
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
15 years 3 months ago
Distributing Google
We consider the problem of wide-area large-scale text search over a peer-to-peer infrastructure. A wide-area search infrastructure with billions of documents and millions of searc...
Vijay Gopalakrishnan, Bobby Bhattacharjee, Peter J...
IJCAI
2007
14 years 11 months ago
Open Information Extraction from the Web
Traditionally, Information Extraction (IE) has focused on satisfying precise, narrow, pre-specified requests from small homogeneous corpora (e.g., extract the location and time o...
Michele Banko, Michael J. Cafarella, Stephen Soder...