Sciweavers

991 search results - page 119 / 199
» Analyzing URL queries
Sort
View
VLDB
1999
ACM
174views Database» more  VLDB 1999»
14 years 1 months ago
Extending Practical Pre-Aggregation in On-Line Analytical Processing
On-Line Analytical Processing (OLAP) based on a dimensional view of data is being used increasingly for the purpose of analyzing very large amounts of data. To improve query perfo...
Torben Bach Pedersen, Christian S. Jensen, Curtis ...
PODS
1997
ACM
182views Database» more  PODS 1997»
14 years 1 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
CIKM
1994
Springer
14 years 28 days ago
TID Hash Joins
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
Robert Marek, Erhard Rahm
ICDIM
2007
IEEE
14 years 21 days ago
Efficient XML storage based on DTM for read-oriented workloads
We propose an XML storage scheme based on Document Table Model (DTM) which expresses an XML document as a table form. When performing query processing on large scale XML data, XML...
Makoto Yui, Jun Miyazaki, Shunsuke Uemura, Hirokaz...
INFOSCALE
2007
ACM
13 years 10 months ago
Load-balancing and caching for collection selection architectures
— To address the rapid growth of the Internet, modern Web search engines have to adopt distributed organizations, where the collection of indexed documents is partitioned among s...
Diego Puppin, Fabrizio Silvestri, Raffaele Perego,...