Sciweavers

2043 search results - page 230 / 409
» The Limits of Querying Ontologies
Sort
View
ICDE
2007
IEEE
137views Database» more  ICDE 2007»
14 years 10 months ago
SAO: A Stream Index for Answering Linear Optimization Queries
Linear optimization queries retrieve the top-K tuples in a sliding window of a data stream that maximize/minimize the linearly weighted sums of certain attribute values. To effici...
Gang Luo, Kun-Lung Wu, Philip S. Yu
GIS
2003
ACM
14 years 10 months ago
The internet spatial spreadsheet: enabling remote visualization of dynamic spatial data and ongoing query results over a network
Moving object databases store and process data for objects that change location frequently. Materialized views maintained over time must be updated to reflect changes due to the m...
Glenn S. Iwerks, Hanan Samet
CIKM
2009
Springer
14 years 3 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
14 years 2 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
MOBICOM
2010
ACM
13 years 9 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao