Sciweavers

1009 search results - page 131 / 202
» On Indexing Line Segments
Sort
View
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 3 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
VLDB
1998
ACM
123views Database» more  VLDB 1998»
14 years 1 months ago
Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships
Time of creation is one of the predominant (often implicit) clustering strategies found not only in Data Warehouse systems: line items are created together with their correspondin...
Sven Helmer, Till Westmann, Guido Moerkotte
WIKIS
2010
ACM
14 years 25 days ago
WikiPics: multilingual image search based on Wiki-mining
This demonstration introduces WikiPics, a language-independent image search engine for Wikimedia Commons. Based on the multilingual thesaurus provided by WikiWord, WikiPics allows...
Daniel Kinzler
ENC
2004
IEEE
14 years 21 days ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...
VLDB
2000
ACM
177views Database» more  VLDB 2000»
14 years 15 days ago
The BT-tree: A Branched and Temporal Access Method
Temporal databases assume a single line of time evolution. In other words, they support timeevolving data. However there are applications which require the support of temporal dat...
Linan Jiang, Betty Salzberg, David B. Lomet, Manue...