Sciweavers

591 search results - page 36 / 119
» The complexity of XPath query evaluation
Sort
View
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
14 years 9 months ago
Optimizing complex queries with multiple relation instances
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
Yu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan
ECCC
2010
122views more  ECCC 2010»
13 years 7 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
CDB
2004
Springer
158views Database» more  CDB 2004»
14 years 15 days ago
Constraint Databases, Data Structures and Efficient Query Evaluation
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
Joos Heintz, Bart Kuijpers
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
13 years 6 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande
ICDE
2011
IEEE
235views Database» more  ICDE 2011»
13 years 14 days ago
Fast data analytics with FPGAs
—The rapidly increasing amount of data available for real-time analysis (i.e., so-called operational business intelligence) is creating an interesting opportunity for creative ap...
Louis Woods, Gustavo Alonso