[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2393216.2393244acmotherconferencesArticle/Chapter ViewAbstractPublication PagesccseitConference Proceedingsconference-collections
research-article

Some new properties of lists and a framework of a list theoretic relation model

Published: 26 October 2012 Publication History

Abstract

The concept of list is of very much importance in the field of computer science as a data structure [6] and in programming languages like LISP [7]. The concept was redefined by Jena, Tripathy and Ghosh [10] in 2001, in an attempt to introduce it as an extension of the concept of characteristic function for sets and count function for multisets. Since then, many concepts related to list theory have been introduced from the new angle and many properties are established ([11], [12] and [13]). In this paper, we continue this effort and define three new concepts of filter, zip* and indexlist. We establish many properties of these notions. Particularly, the concept of filter is of enough importance and interest. It has many applications in array manipulation in data structure [1, 4, 8] and query realization from databases [5, 14]. We propose the design of a list theory based relational database model using position function approach and illustrate how query processing can be realized for the relational algebraic operation of 'Selection' on it, using the 'filter' operation.

References

[1]
Aho, A. V., Ullman, J. D. and Hopcroft, J. E.: Data Structures and Algorithms, Addison-Wesley Series in Computer Science and Information Processing, (1987).
[2]
Bird, R. and Walder, P.: Introduction to Functional Programming, Prentice Hall International Series in Comp. Sc. (1988).
[3]
Codd, E.: A Relational Model of Data for Large Shared Data Banks, Commn. of the ACM, 13, pp. 377--387, (1970), http://doi.acm.org/10.1145/362384.362685
[4]
Cormen, T. H., Leiserman, C. E., Rivest, R. L. and Stein, C.: Introduction to Algorithms (3rd Edition), MIT press, Cambridge, England, (2011).
[5]
Elmasri, R. and Navathe, S. K.: Fundamentals of Database Systems, Pearson education, (2004).
[6]
Haskell, R.: The Craft of Functional Programming (2nd Edition), Simon Thomson, Pearson Addison Wesley Longman, (2008).
[7]
Quince, C.: LISP in Small Pieces, Cambridge University Press, (1966).
[8]
Rabhi, F.: Algorithms: A Functional Programming Approach, International Computer Science Series, (2008).
[9]
Tanimoto, S. L. and Tanimoto, S: The elements of Artificial Intelligence using Common LISP, (2nd Edition), Principles of Computer Science Series, (2008).
[10]
Tripathy, B. K., Jena, S. P. and Ghosh, S. K.: On the Theory of Bags and Lists, Information Sciences, 132, pp. 241--254, (Feb 2001), http://doi.acm.org/10.1016/S0020-0255(01)00066-4
[11]
Tripathy, B. K. and Pattnaik, G. P.: On Some Properties of Lists and Fuzzy Lists, Information Sciences---Informatics and Computer Science: An International Journal, 168, pp. 9--23, (Dec 2004). http://doi.acm.org/10.1016/j.ins.2003.05.016
[12]
Tripathy, B. K. and Gantayat, S. S.: Some More Properties of Lists and Fuzzy Lists, Information Sciences --- Informatics and Computer Science, 166, pp. 167--179, (Oct 2004), http://doi.acm.org/10.1016/j.ins.2003.10.014
[13]
Tripathy, B. K. and Choudhury, P. K: Intuitionistic Fuzzy Lists, NIFS, 9, no.2, pp. 61--73, (2003).
[14]
Ullman, J. D.: Fundamentals of Database Systems, Galgotia Publications, New Delhi, (1997).
[15]
Yager, R. R.: On the Theory of Bags, Intl. Jour. of General Systems., 13, pp. 23--37, (1986).
[16]
www.bts.gov, Bureau of Transportation Statistics, USA.

Cited By

View all
  • (2013)Conceptual Application of List Theory to Data StructuresAdvances in Computing and Information Technology10.1007/978-3-642-31552-7_56(551-560)Online publication date: 2013

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
CCSEIT '12: Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
October 2012
800 pages
ISBN:9781450313100
DOI:10.1145/2393216
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • Avinashilingam University: Avinashilingam University

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 October 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. filter
  2. indexlist
  3. list
  4. relation
  5. selection
  6. table
  7. tuple
  8. zip*

Qualifiers

  • Research-article

Conference

CCSEIT '12
Sponsor:
  • Avinashilingam University

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 09 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2013)Conceptual Application of List Theory to Data StructuresAdvances in Computing and Information Technology10.1007/978-3-642-31552-7_56(551-560)Online publication date: 2013

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media