Timehash: Hierarchical Time Indexing for Efficient Business Hours Search
Jinoh Kim, Jaewon Son

TL;DR
Timehash introduces a hierarchical time indexing method that drastically reduces index size while ensuring perfect accuracy, enabling efficient large-scale temporal filtering in search systems.
Contribution
We propose a novel multi-resolution hierarchical time indexing algorithm that significantly reduces index size and maintains 100% precision, tailored through data-driven hierarchy selection.
Findings
Achieves over 99% reduction in index size compared to minute-level indexing.
Maintains zero false positives and negatives in large-scale tests.
Supports scalable and complex temporal filtering scenarios.
Abstract
Temporal range filtering is a critical operation in large-scale search systems, particularly for location-based services that need to filter businesses by operating hours. Traditional approaches either suffer from poor query performance (scope filtering) or index size explosion (minute-level indexing). We present Timehash, a novel hierarchical time indexing algorithm that achieves over 99% reduction in index size compared to minute-level indexing while maintaining 100% precision. Timehash employs a flexible multi-resolution strategy with customizable hierarchical levels. Through empirical analysis on distributions from 12.6 million business records of a production location search service, we demonstrate a data-driven methodology for selecting optimal hierarchies tailored to specific data distributions. We evaluated Timehash on up to 12.6 million synthetic POIs generated from…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTime Series Analysis and Forecasting · Data Management and Algorithms · Advanced Database Systems and Queries
