Abstract - The rapid advances of wireless and web technologies enable the mobile users to request various kinds of services via mobile devices at anytime and anywhere. To provide the users obtain needed information effectively is an important issue in the mobile web systems. In this paper, we define the match join of mobile users U, movement locations L, staying time in timestamps T, and service requests S with weight w to be a subset of the w-join of U, L, T, and S such that each tuple of U, L, T, and S contributes to at least one result tuple. Match joins and their generalizations belong to a wide category of matching problems that have brought about a great deal of attention in disciplines including operations research and theoretical computer science. However, to our best knowledge, no studies have been done on the problem of mining matching mobile access patterns with four relations of mobile users, movement locations, staying time in timestamps and service requests considered sim...