Sciweavers

2370 search results - page 329 / 474
» A Structured Set of Higher-Order Problems
Sort
View
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 3 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
151
Voted
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 3 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
205
Voted
SIGMOD
2008
ACM
129views Database» more  SIGMOD 2008»
16 years 3 months ago
An xml index advisor for DB2
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...
Iman Elghandour, Ashraf Aboulnaga, Daniel C. Zilio...
SIGMOD
2006
ACM
114views Database» more  SIGMOD 2006»
16 years 3 months ago
Ordering the attributes of query results
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
Gautam Das, Vagelis Hristidis, Nishant Kapoor, S. ...
139
Voted
DASFAA
2009
IEEE
96views Database» more  DASFAA 2009»
15 years 10 months ago
Materialized View Selection in XML Databases
Materialized views, a rdbms silver bullet, demonstrate its efficacy in many applications, especially as a data warehousing/decison support system tool. The pivot of playing materia...
Nan Tang, Jeffrey Xu Yu, Hao Tang, M. Tamer Ö...