[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Improving Space-Efficiency in Temporal Text-Indexing

  • Conference paper
Database Systems for Advanced Applications (DASFAA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3453))

Included in the following conference series:

Abstract

Support for temporal text-containment queries is of interest in a number of contexts. In previous papers we have presented two approaches to temporal text-indexing, the V2X and ITTX indexes. In this paper, we first present improvements to the previous techniques. We then perform a study of the space usage of the indexing approaches based on both analytical models and results from indexing temporal text collections. These results show for what kind of document collections the different techniques should be employed. The results also show that regarding space usage, the new ITTX/VIDPI technique proposed in this paper is in most cases superior to V2X, except in the case of patterns of high number of new documents relative to number of updated documents.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Nørvåg, K.: Supporting temporal text-containment queries in temporal document databases. Journal of Data & Knowledge Engineering 49, 105–125 (2004)

    Article  Google Scholar 

  2. Nørvåg, K.: Space-efficient support for temporal text indexing in a document archive context. In: Koch, T., Sølvberg, I.T. (eds.) ECDL 2003. LNCS, vol. 2769, pp. 511–522. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Salzberg, B., Tsotras, V.J.: Comparison of access methods for time-evolving data. ACM Computing Surveys 31, 158–221 (1999)

    Article  Google Scholar 

  4. Anick, P.G., Flynn, R.A.: Versioning a full-text information retrieval system. In: Proceedings of SIGIR 1992 (1992)

    Google Scholar 

  5. Mendelzon, A.O., Rizzolo, F., Vaisman, A.A.: Indexing temporal XML documents. In: Proceedings of VLDB 2004 (2004)

    Google Scholar 

  6. Nørvåg, K.: Algorithms for temporal query operators in XML databases. In: Workshop on XML-Based Data Management and Multimedia Engineering (2002)

    Google Scholar 

  7. Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  8. Olson, M.A., Bostic, K., Seltzer, M.: Berkeley DB. In: Proceedings of the FREENIX Track: 1999 USENIX Annual Technical Conference (1999)

    Google Scholar 

  9. Elias, P.: Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory IT-21, 194–203 (1975)

    Article  MathSciNet  Google Scholar 

  10. Fraenkel, A., Klein, S.: Novel compression of sparse bit-strings — preliminary report. In: Combinatorial Algorithms on Words. NATO ASI Series, vol. 12. Springer, Heidelberg (1985)

    Google Scholar 

  11. Nørvåg, K., Nybø, A.O.: Creating synthetic temporal document collections. Technical Report IDI 6/2004, Norwegian University of Science and Technology (2004), Available from http://www.idi.ntnu.no/grupper/DB-grp/

  12. Nørvåg, K.: Algorithms for granularity reduction in temporal document databases (Accepted for publication in Information Systems)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nørvåg, K., Nybø, A.O. (2005). Improving Space-Efficiency in Temporal Text-Indexing. In: Zhou, L., Ooi, B.C., Meng, X. (eds) Database Systems for Advanced Applications. DASFAA 2005. Lecture Notes in Computer Science, vol 3453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11408079_72

Download citation

  • DOI: https://doi.org/10.1007/11408079_72

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25334-1

  • Online ISBN: 978-3-540-32005-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics