Sciweavers

707 search results - page 41 / 142
» Processing queries on tree-structured data efficiently
Sort
View
APPINF
2003
13 years 10 months ago
Fast Recursive Data Processing in Graphs using Reduction
This paper presents an algorithm for recursive data processing in directed graphs. The proposed algorithm applies graph reduction in order to determine both starting points and a ...
J. H. ter Bekke, J. A. Bakker
DASFAA
2010
IEEE
189views Database» more  DASFAA 2010»
13 years 12 months ago
Efficient Skyline Maintenance for Streaming Data with Partially-Ordered Domains
We address the problem of skyline query processing for a count-based window of continuous streaming data that involves both totally- and partially-ordered attribute domains. In thi...
Yuan Fang, Chee-Yong Chan
DAGSTUHL
2007
13 years 10 months ago
An XML Framework for Integrating Continuous Queries, Composite Event Detection, and Database Condition Monitoring for Multiple D
Abstract Current, data-driven applications have become more dynamic in nature, with the need to respond to events generated from distributed sources or to react to information extr...
Susan Darling Urban, Suzanne W. Dietrich, Yi Chen
ICDE
2008
IEEE
130views Database» more  ICDE 2008»
14 years 10 months ago
Efficient Computation of Diverse Query Results
We study the problem of efficiently computing diverse query results in online shopping applications, where users specify queries through a form interface that allows a mix of stru...
Erik Vee, Utkarsh Srivastava, Jayavel Shanmugasund...
EDBT
2006
ACM
194views Database» more  EDBT 2006»
14 years 8 months ago
On Concurrency Control in Sliding Window Queries over Data Streams
Abstract. Data stream systems execute a dynamic workload of longrunning and one-time queries, with the streaming inputs typically bounded by sliding windows. For efficiency, window...
Lukasz Golab, Kumar Gaurav Bijay, M. Tamer Öz...