Sciweavers

1567 search results - page 168 / 314
» Compressing Relations and Indexes
Sort
View
136
Voted
GFKL
2006
Springer
78views Data Mining» more  GFKL 2006»
15 years 8 months ago
Putting Successor Variety Stemming to Work
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
Benno Stein, Martin Potthast
AVI
2010
15 years 6 months ago
An architecture and a visual interface for tagging the 3D web
Content classification performed by end users is spreading through the web. Most of the work done so far is related to the hypermedia web. In spite of that, there is a growing mas...
Fabio Pittarello
SIGMOD
2011
ACM
170views Database» more  SIGMOD 2011»
14 years 7 months ago
Querying contract databases based on temporal behavior
Considering a broad definition for service contracts (beyond web services and software, e.g. airline tickets and insurance policies), we tackle the challenges of building a high ...
Elio Damaggio, Alin Deutsch, Dayou Zhou
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
16 years 6 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
WWW
2010
ACM
15 years 12 months ago
A pattern tree-based approach to learning URL normalization rules
Duplicate URLs have brought serious troubles to the whole pipeline of a search engine, from crawling, indexing, to result serving. URL normalization is to transform duplicate URLs...
Tao Lei, Rui Cai, Jiang-Ming Yang, Yan Ke, Xiaodon...