↓ Skip to main content

String processing and information retrieval : 12th international conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005 : proceedings

Overview of attention for book
Cover of 'String processing and information retrieval : 12th international conference, SPIRE 2005, Buenos Aires, Argentina, November 2-4, 2005 : proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Enhanced Byte Codes with Restricted Prefix Properties
  3. Altmetric Badge
    Chapter 2 Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
  4. Altmetric Badge
    Chapter 3 Compressed Perfect Embedded Skip Lists for Quick Inverted-Index Lookups
  5. Altmetric Badge
    Chapter 4 XML Retrieval with a Natural Language Interface
  6. Altmetric Badge
    Chapter 5 Recommending Better Queries from Click-Through Data
  7. Altmetric Badge
    Chapter 6 A Bilingual Linking Service for the Web
  8. Altmetric Badge
    Chapter 7 Evaluating Hierarchical Clustering of Search Results
  9. Altmetric Badge
    Chapter 8 Counting Suffix Arrays and Strings
  10. Altmetric Badge
    Chapter 9 Towards Real-Time Suffix Tree Construction
  11. Altmetric Badge
    Chapter 10 Rank-Sensitive Data Structures
  12. Altmetric Badge
    Chapter 11 Cache-Conscious Collision Resolution in String Hash Tables
  13. Altmetric Badge
    Chapter 12 Measuring the Difficulty of Distance-Based Indexing
  14. Altmetric Badge
    Chapter 13 N-Gram Similarity and Distance
  15. Altmetric Badge
    Chapter 14 Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
  16. Altmetric Badge
    Chapter 15 Classifying Sentences Using Induced Structure
  17. Altmetric Badge
    Chapter 16 Counting Lumps in Word Space: Density as a Measure of Corpus Homogeneity
  18. Altmetric Badge
    Chapter 17 Multi-label Text Categorization Using K-Nearest Neighbor Approach with M-Similarity
  19. Altmetric Badge
    Chapter 18 Lydia: A System for Large-Scale News Analysis
  20. Altmetric Badge
    Chapter 19 Composite Pattern Discovery for PCR Application
  21. Altmetric Badge
    Chapter 20 Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array
  22. Altmetric Badge
    Chapter 21 Linear Time Algorithm for the Generalised Longest Common Repeat Problem
  23. Altmetric Badge
    Chapter 22 Application of Clustering Technique in Multiple Sequence Alignment
  24. Altmetric Badge
    Chapter 23 Stemming Arabic Conjunctions and Prepositions
  25. Altmetric Badge
    Chapter 24 XML Multimedia Retrieval
  26. Altmetric Badge
    Chapter 25 Retrieval Status Values in Information Retrieval Evaluation
  27. Altmetric Badge
    Chapter 26 A Generalization of the Method for Evaluation of Stemming Algorithms Based on Error Counting
  28. Altmetric Badge
    Chapter 27 Necklace Swap Problem for Rhythmic Similarity Measures
  29. Altmetric Badge
    Chapter 28 Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
  30. Altmetric Badge
    Chapter 29 Restricted Transposition Invariant Approximate String Matching Under Edit Distance
  31. Altmetric Badge
    Chapter 30 Fast Plagiarism Detection System
  32. Altmetric Badge
    Chapter 31 A Model for Information Retrieval Based on Possibilistic Networks
  33. Altmetric Badge
    Chapter 32 Comparison of Representations of Multiple Evidence Using a Functional Framework for IR
  34. Altmetric Badge
    Chapter 33 Deriving TF-IDF as a Fisher Kernel
  35. Altmetric Badge
    Chapter 34 Utilizing Dynamically Updated Estimates in Solving the Longest Common Subsequence Problem
  36. Altmetric Badge
    Chapter 35 Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty
  37. Altmetric Badge
    Chapter 36 L 1 Pattern Matching Lower Bound
  38. Altmetric Badge
    Chapter 37 Approximate Matching in the L ∞ Metric
  39. Altmetric Badge
    Chapter 38 An Edit Distance Between RNA Stem-Loops
  40. Altmetric Badge
    Chapter 39 A Multiple Graph Layers Model with Application to RNA Secondary Structures Comparison
  41. Altmetric Badge
    Chapter 40 Normalized Similarity of RNA Sequences
  42. Altmetric Badge
    Chapter 41 A Fast Algorithmic Technique for Comparing Large Phylogenetic Trees
  43. Altmetric Badge
    Chapter 42 Practical and Optimal String Matching
  44. Altmetric Badge
    Chapter 43 A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC’s
  45. Altmetric Badge
    Chapter 44 A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching
Attention for Chapter 11: Cache-Conscious Collision Resolution in String Hash Tables
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

wikipedia
5 Wikipedia pages

Citations

dimensions_citation
6 Dimensions

Readers on

mendeley
28 Mendeley
citeulike
1 CiteULike
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Cache-Conscious Collision Resolution in String Hash Tables
Chapter number 11
Book title
String Processing and Information Retrieval
Published in
Lecture notes in computer science, November 2005
DOI 10.1007/11575832_11
Book ISBNs
978-3-54-029740-6, 978-3-54-032241-2
Authors

Askitis, Nikolas, Zobel, Justin, Nikolas Askitis, Justin Zobel

Editors

Mariano Consens, Gonzalo Navarro

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 28 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Japan 1 4%
Hungary 1 4%
Canada 1 4%
Unknown 25 89%

Demographic breakdown

Readers by professional status Count As %
Student > Master 7 25%
Student > Ph. D. Student 6 21%
Other 2 7%
Student > Doctoral Student 2 7%
Professor > Associate Professor 2 7%
Other 4 14%
Unknown 5 18%
Readers by discipline Count As %
Computer Science 21 75%
Engineering 2 7%
Unknown 5 18%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 03 September 2023.
All research outputs
#7,409,093
of 22,653,392 outputs
Outputs from Lecture notes in computer science
#2,489
of 8,122 outputs
Outputs of similar age
#20,853
of 60,710 outputs
Outputs of similar age from Lecture notes in computer science
#7
of 47 outputs
Altmetric has tracked 22,653,392 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,122 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 54% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 60,710 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 14th percentile – i.e., 14% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 47 others from the same source and published within six weeks on either side of this one. This one is in the 40th percentile – i.e., 40% of its contemporaries scored the same or lower than it.