964 search results - page 166 / 193 » Efficiently Ordering Query Plans for Data Integration |
148
click to vote
CIKM
1993
Springer
15 years 8 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
146
click to vote
FUN
2010
Springer
15 years 7 months ago
2010
Springer
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
169
click to vote
TKDE
2011
14 years 11 months ago
2011
—Classification has been used for modeling many kinds of data sets, including sets of items, text documents, graphs, and networks. However, there is a lack of study on a new kind...
140
click to vote
PVLDB
2008
15 years 3 months ago
2008
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
136
click to vote
CODES
2000
IEEE
15 years 8 months ago
2000
IEEE
Memory interleaving is a cost-efficient approach to increase bandwidth. Improving data access locality and reducing memory access conflicts are two important aspects to achieve hi...