Sciweavers

707 search results - page 28 / 142
» Processing queries on tree-structured data efficiently
Sort
View
WSCG
2003
179views more  WSCG 2003»
13 years 10 months ago
Antipole Clustering for Fast Texture Synthesis
This paper describes a new method for analysis/synthesis of textures using a non-parametric multi-resolution approach able to reproduce efficiently the generative stochastic proce...
Sebastiano Battiato, Alfredo Pulvirenti, Diego Ref...
ADC
2007
Springer
193views Database» more  ADC 2007»
14 years 2 months ago
Optimizing XPath Queries on Streaming XML Data
XML stream processing has recently become popular for many applications such as selective dissemination of information. Several approaches have been proposed and most of them are ...
Keerati Jittrawong, Raymond K. Wong
RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 6 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei
VLDB
2005
ACM
112views Database» more  VLDB 2005»
14 years 2 months ago
Content-Based Routing: Different Plans for Different Data
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
Pedro Bizarro, Shivnath Babu, David J. DeWitt, Jen...
CIDR
2009
145views Algorithms» more  CIDR 2009»
13 years 9 months ago
Continuous Analytics: Rethinking Query Processing in a Network-Effect World
Modern data analysis applications driven by the Network Effect are pushing traditional database and data warehousing technologies beyond their limits due to their massively increa...
Michael J. Franklin, Sailesh Krishnamurthy, Neil C...