Sciweavers

1679 search results - page 206 / 336
» Pointcuts as Functional Queries
Sort
View
FOCS
2000
IEEE
15 years 11 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
15 years 10 months ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 10 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
HT
2007
ACM
15 years 10 months ago
Lesson learnt from a large-scale industrial semantic web application
The design and maintenance of an aero-engine generates a significant amount of documentation. When designing new engines, engineers must obtain knowledge gained from maintenance o...
Sylvia C. Wong, Richard M. Crowder, Gary B. Wills,...
ADCS
2004
15 years 7 months ago
On the Effectiveness of Relevance Profiling
Relevance profiling is a general process for withindocument retrieval. Given a query, a profile of retrieval status values is computed by sliding a fixed sized window across a doc...
David J. Harper, David Lee