Sciweavers

591 search results - page 35 / 119
» The complexity of XPath query evaluation
Sort
View
PARLE
1992
14 years 25 days ago
Performance Evaluation of Parallel Transaction Processing in Shared Nothing Database Systems
Complex and data-intensive database queries mandate parallel processing strategies to achieve sufficiently short response times. In praxis, parallel database processing is mostly b...
Robert Marek, Erhard Rahm
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
14 years 9 months ago
High-performance complex event processing over streams
In this paper, we present the design, implementation, and evaluation of a system that executes complex event queries over real-time streams of RFID readings encoded as events. The...
Eugene Wu 0002, Yanlei Diao, Shariq Rizvi
ICDE
2005
IEEE
101views Database» more  ICDE 2005»
14 years 10 months ago
GPIVOT: Efficient Incremental Maintenance of Complex ROLAP Views
Data warehousing and on-line analytical processing (OLAP) are essential for decision support applications. Common OLAP operations include for example drill down, roll up, pivot an...
Songting Chen, Elke A. Rundensteiner
JC
2007
94views more  JC 2007»
13 years 8 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
DMKD
2004
ACM
133views Data Mining» more  DMKD 2004»
14 years 2 months ago
Mining complex matchings across Web query interfaces
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. As a new attempt, this p...
Bin He, Kevin Chen-Chuan Chang, Jiawei Han