Sciweavers

3225 search results - page 398 / 645
» Query Optimization by Stored Queries
Sort
View
TPDS
2010
118views more  TPDS 2010»
15 years 5 months ago
Using Parallel Bloom Filters for Multiattribute Representation on Network Services
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...
Bin Xiao, Yu Hua
ICDE
2012
IEEE
212views Database» more  ICDE 2012»
13 years 9 months ago
Attribute-Based Subsequence Matching and Mining
—Sequence analysis is very important in our daily life. Typically, each sequence is associated with an ordered list of elements. For example, in a movie rental application, a cus...
Yu Peng, Raymond Chi-Wing Wong, Liangliang Ye, Phi...
WISE
2005
Springer
16 years 4 days ago
Scalable Instance Retrieval for the Semantic Web by Approximation
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...
Holger Wache, Perry Groot, Heiner Stuckenschmidt
EDBTW
2004
Springer
15 years 12 months ago
P2PR-Tree: An R-Tree-Based Spatial Index for Peer-to-Peer Environments
Abstract. The unprecedented growth and increased importance of geographically distributed spatial data has created a strong need for efficient sharing of such data. Interestingly, ...
Anirban Mondal, Yi Lifu, Masaru Kitsuregawa
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 12 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...