Sciweavers

6974 search results - page 1145 / 1395
» Querying Semi-Structured Data
Sort
View
114
Voted
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 4 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
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 ...
Aaron Williams
CIKM
2008
Springer
15 years 2 months ago
Workload-based optimization of integration processes
The efficient execution of integration processes between distributed, heterogeneous data sources and applications is a challenging research area of data management. These inn proc...
Matthias Böhm, Uwe Wloka, Dirk Habich, Wolfga...
104
Voted
AMW
2010
15 years 2 months ago
Run-time Optimization for Pipelined Systems
Traditional optimizers fail to pick good execution plans, when faced with increasingly complex queries and large data sets. This failure is even more acute in the context of XQuery...
Riham Abdel Kader, Maurice van Keulen, Peter A. Bo...
104
Voted
BIS
2010
187views Business» more  BIS 2010»
15 years 2 months ago
Faceted Wikipedia Search
Wikipedia articles contain, besides free text, various types of structured information in the form of wiki markup. The type of wiki content that is most valuable for search are Wik...
Rasmus Hahn, Christian Bizer, Christopher Sahnwald...
SDM
2007
SIAM
107views Data Mining» more  SDM 2007»
15 years 2 months ago
On Demand Phenotype Ranking through Subspace Clustering
High throughput biotechnologies have enabled scientists to collect a large number of genetic and phenotypic attributes for a large collection of samples. Computational methods are...
Xiang Zhang, Wei Wang 0010, Jun Huan
« Prev « First page 1145 / 1395 Last » Next »