Sciweavers

6615 search results - page 53 / 1323
» Indexing Multiple Sets
Sort
View
TKDE
2002
127views more  TKDE 2002»
14 years 11 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
CIKM
2006
Springer
15 years 3 months ago
A combination of trie-trees and inverted files for the indexing of set-valued attributes
Set-valued attributes frequently occur in contexts like marketbasked analysis and stock market trends. Late research literature has mainly focused on set containment joins and dat...
Manolis Terrovitis, Spyros Passas, Panos Vassiliad...
ICLP
2007
Springer
15 years 6 months ago
Demand-Driven Indexing of Prolog Clauses
As logic programming applications grow in size, Prolog systems need to efficiently access larger and larger data sets and the need for any- and multiargument indexing becomes more...
Vítor Santos Costa, Konstantinos F. Sagonas...
XSYM
2004
Springer
108views Database» more  XSYM 2004»
15 years 5 months ago
XIST: An XML Index Selection Tool
XML indices are essential for efficiently processing XML queries which typically have predicates on both structures and values. Since the number of all possible structural and val...
Kanda Runapongsa, Jignesh M. Patel, Rajesh Bordawe...
DAWAK
2001
Springer
15 years 4 months ago
Shared Index Scans for Data Warehouses
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos