The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Versioning a full-text information retrieval system
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Indexing Valid Time Databases via B+-Trees
IEEE Transactions on Knowledge and Data Engineering
Supporting temporal text-containment queries in temporal document databases
Data & Knowledge Engineering
Inverted files for text search engines
ACM Computing Surveys (CSUR)
DyST: Dynamic and Scalable Temporal Text Indexing
TIME '06 Proceedings of the Thirteenth International Symposium on Temporal Representation and Reasoning
Chronica: a temporal web search engine
ICWE '06 Proceedings of the 6th international conference on Web engineering
A time machine for text search
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
FluxCapacitor: efficient time-travel text search
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
On the value of temporal information in information retrieval
ACM SIGIR Forum
Efficient indexing of versioned document sequences
ECIR'07 Proceedings of the 29th European conference on IR research
Improving space-efficiency in temporal text-indexing
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Hi-index | 0.00 |
Most Web pages contain temporal information. However, most of previous studies only consider the update time of Web pages rather than fully exploit different temporal features in Web. In this paper, we propose a novel approach to fusing different temporal features in Web pages to build an efficient index structure for temporal-textual Web search. Specially, we focus on update time and content time, and propose to use a hybrid index structure to organize textual keywords, update time, and content time. In particular, we study three mechanisms to implement a hybrid index structure for temporal-textual Web search: (1) first inverted file then MAP21-tree and B+-tree, (2) first inverted file then MAP21-tree, (3) expanded inverted file. We conduct experiments on a real dataset to evaluate the performance of those hybrid index structures. The experimental results show that the first inverted file then MAP21-tree index structure has the best query performance.