Sciweavers

491 search results - page 27 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
DEBS
2007
ACM
13 years 11 months ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert
ASPDAC
2005
ACM
102views Hardware» more  ASPDAC 2005»
13 years 9 months ago
A framework for automated and optimized ASIP implementation supporting multiple hardware description languages
— Architecture Description Languages (ADLs) are widely used to perform design space exploration for Application Specific Instruction Set Processors (ASIPs). While the design spa...
Oliver Schliebusch, Anupam Chattopadhyay, David Ka...
VLDB
2005
ACM
162views Database» more  VLDB 2005»
14 years 1 months ago
XQuery Implementation in a Relational Database System
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...
Shankar Pal, Istvan Cseri, Oliver Seeliger, Michae...
DEXA
2005
Springer
112views Database» more  DEXA 2005»
14 years 1 months ago
Distribution Rules for Array Database Queries
Abstract. Non-trivial retrieval applications involve complex computations on large multi-dimensional datasets. These should, in principle, benefit from the use of relational datab...
Alex van Ballegooij, Roberto Cornacchia, Arjen P. ...
PVLDB
2008
160views more  PVLDB 2008»
13 years 7 months ago
BayesStore: managing large, uncertain data repositories with probabilistic graphical models
Several real-world applications need to effectively manage and reason about large amounts of data that are inherently uncertain. For instance, pervasive computing applications mus...
Daisy Zhe Wang, Eirinaios Michelakis, Minos N. Gar...