Abstract
The query performance for tracing tags depends upon the distribution of tag trajectories in the data space. We examine a more efficient representation of tag trajectories by means of ordering the set of domain values. Our analysis shows that the order of Location IDentifiers (LIDs) can give a great impact on the efficiency of query processing. To find out the optimal ordering of LIDs, we propose a new LID proximity function to rearrange an arbitrary order of LIDs. This function enables logically adjacent tag trajectories, which are frequently accessed together, to be stored in close proximity on the disk. To determine the optimal sequence of LIDs in the domain, we also propose a reordering scheme of LIDs. The experimental results show that the proposed reordering scheme achieves better query processing than the previous methods of assigning LIDs.
“This work was supported by the Korea Research Foundation Grant funded by the Korean Government(MOEHRD)” (The Regional Research Universities Program/Research Center for Logistics Information Technology).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ban, C.H., Hong, B.H., Kim, D.H.: Time Parameterized Interval R-tree for Tracing Tags in RFID Systems. In: Andersen, K.V., Debenham, J., Wagner, R. (eds.) DEXA 2005. LNCS, vol. 3588, pp. 503–513. Springer, Heidelberg (2005)
Lin, D., Elmongui, H.G., Bertino, E., Ooi, B.C.: Data Management in RFID Applications. In: Wagner, R., Revell, N., Pernul, G. (eds.) DEXA 2007. LNCS, vol. 4653, pp. 434–444. Springer, Heidelberg (2007)
Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches to the Indexing of Moving Object Trajectories. In: International Conference on VLDB, pp. 395–406 (2000)
Whitley, D.: A Genetic Algorithm Tutorial. Statistics and Computing 4, 65–85 (1994)
EPC global: EPC Information Services (EPCIS) Specification, Ver. 1.0, EPC global Inc., (2006)
Jagadish, H.V.: Linear Clustering of Objects with Multiple Attributes. ACM SIGMOD 19(2), 332–342 (1990)
Kamel, I., Faloutsos, C.: On Packing R-trees. CIKM, 490–499 (1993)
Mokbel, M.F., Ghanem, T.M., Aref, W.G.: Spatio-temporal Access Methods. IEEE Data Engineering Bulletin 26(2), 40–49 (2003)
Harrison, M.: EPC Information Service – Data Model and Queries, Technical Report, Auto-ID Center (2003)
Beckmann, N., Kriegel, H.P.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. ACM SIGMOD 19(2), 322–331 (1990)
Skiena, S.S.: The Algorithm Design Manual. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahn, S., Hong, B. (2008). Reordering of Location Identifiers for Indexing an RFID Tag Object Database. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2008. Lecture Notes in Computer Science, vol 5181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85654-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-85654-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85653-5
Online ISBN: 978-3-540-85654-2
eBook Packages: Computer ScienceComputer Science (R0)