Sciweavers

2514 search results - page 123 / 503
» On the Computation of Approximations of Database Queries
Sort
View
SIGMOD
2003
ACM
161views Database» more  SIGMOD 2003»
16 years 6 months ago
Approximate Join Processing Over Data Streams
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
WINE
2007
Springer
151views Economy» more  WINE 2007»
16 years 16 days ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...
ICDE
2005
IEEE
116views Database» more  ICDE 2005»
16 years 7 months ago
RDF Aggregate Queries and Views
Resource Description Framework (RDF) is a rapidly expanding web standard. RDF databases attempt to track the massive amounts of web data and services available. In this paper, we ...
Edward Hung, Yu Deng, V. S. Subrahmanian
ICPR
2002
IEEE
16 years 7 months ago
GraphGrep: A Fast and Universal Method for Querying Graphs
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
Rosalba Giugno, Dennis Shasha
ICDE
2005
IEEE
173views Database» more  ICDE 2005»
16 years 7 months ago
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
We consider the problem of efficiently computing the skyline against the most recent N elements in a data stream seen so far. Specifically, we study the n-of-N skyline queries; th...
Xuemin Lin, Yidong Yuan, Wei Wang 0011, Hongjun Lu