294 search results - page 31 / 59 » Efficiently Processing Queries on Interval-and-Value Tuples ... |
241
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
234
click to vote
VLDB
2008
ACM
16 years 6 months ago
2008
ACM
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
282
click to vote
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
158
click to vote
VLDB
2002
ACM
15 years 5 months ago
2002
ACM
Star queries are the most prevalent kind of queries in data warehousing, OLAP and business intelligence applications. Thus, there is an imperative need for efficiently processing ...
153
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...