Sciweavers

505 search results - page 18 / 101
» Efficient Temporal Join Processing Using Indices
Sort
View
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
14 years 7 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...
ECAI
2006
Springer
13 years 11 months ago
Efficient Knowledge Acquisition for Extracting Temporal Relations
Abstract. Machine learning approaches in natural language processing often require a large annotated corpus. We present a complementary approach that utilizes expert knowledge to o...
Son Bao Pham, Achim G. Hoffmann
ICDE
2003
IEEE
161views Database» more  ICDE 2003»
14 years 8 months ago
Structural Join Order Selection for XML Query Optimization
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
PVLDB
2008
138views more  PVLDB 2008»
13 years 6 months ago
A skip-list approach for efficiently processing forecasting queries
Time series data is common in many settings including scientific and financial applications. In these applications, the amount of data is often very large. We seek to support pred...
Tingjian Ge, Stanley B. Zdonik
ICIP
2005
IEEE
14 years 9 months ago
Predictive compression of dynamic 3D meshes
An efficient algorithm for compression of dynamic time-consistent 3D meshes is presented. Such a sequence of meshes contains a large degree of temporal statistical dependencies tha...
Aljoscha Smolic, Karsten Müller, Matthias Kau...