Sciweavers

4913 search results - page 836 / 983
» Results and Perspectives of the G
Sort
View
SIGMOD
2004
ACM
241views Database» more  SIGMOD 2004»
16 years 6 months ago
SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases
This paper introduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluating a set of concurrent continuous spatio-temporal queries. SINA ...
Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref
PODS
2006
ACM
196views Database» more  PODS 2006»
16 years 6 months ago
The containment problem for REAL conjunctive queries with inequalities
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
T. S. Jayram, Phokion G. Kolaitis, Erik Vee
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
16 years 6 months ago
Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
Panagiotis G. Ipeirotis, Vagelis Hristidis, Yuheng...
WWW
2010
ACM
16 years 1 months ago
Visualizing differences in web search algorithms using the expected weighted hoeffding distance
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
Mingxuan Sun, Guy Lebanon, Kevyn Collins-Thompson
COMPGEOM
2006
ACM
16 years 14 days ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...