Sciweavers

6615 search results - page 94 / 1323
» Indexing Multiple Sets
Sort
View
VLDB
2003
ACM
147views Database» more  VLDB 2003»
16 years 4 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
CORR
2010
Springer
182views Education» more  CORR 2010»
15 years 4 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
DASFAA
2008
IEEE
109views Database» more  DASFAA 2008»
15 years 11 months ago
Bulk-Loading the ND-Tree in Non-ordered Discrete Data Spaces
Applications demanding multidimensional index structures for performing efficient similarity queries often involve a large amount of data. The conventional tuple-loading approach t...
Hyun-Jeong Seok, Gang Qian, Qiang Zhu, Alexander R...
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
16 years 5 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
ENTCS
2008
91views more  ENTCS 2008»
15 years 4 months ago
A Name Abstraction Functor for Named Sets
bstraction Functor for Named Sets Vincenzo Ciancia 1 Ugo Montanari 1 Department of Computer Science University of Pisa lem of dening fully abstract operational models of name pass...
Vincenzo Ciancia, Ugo Montanari