Semantic (Web) Technology In Action: Ontology Driven Information Systems for Search, Integration and Analysis

Semantics is seen as the key ingredient in the next phase of the Web infrastructure as well as the next generation of information systems applications. In this context, we review some of the reservations expressed about the viability of the Semantic Web. We respond to these by identifying a Semantic Technology that supports the key capabilities also needed to realize the Semantic Web vision, namely representing, acquiring and utilizing knowledge. Given that scalability is a key challenge, we briefly review our observations from developing three classes of real world applications and corresponding technology components: search/browsing, integration, and analytics. We distinguish this proven technology from some parts of the Semantic Web approach and offer subjective remarks which we hope will foster additional debate.

[1]  Ramanathan V. Guha,et al.  Semantic search , 2003, WWW '03.

[2]  Haihong Li,et al.  Algorithms for Automated Extractioin of Man-Made Objects from Raster Image Data in GIS , 1994, IGIS.

[3]  David B. Lomet,et al.  Access methods for multiversion data , 1989, SIGMOD '89.

[4]  Dimitrios Gunopulos,et al.  Indexing Animated Objects Using Spatiotemporal Access Methods , 2001, IEEE Trans. Knowl. Data Eng..

[5]  F. Warren Burton,et al.  Implementation of Overlapping B-Trees for Time and Space Efficient Representation of Collections of Similar Files , 1990, Comput. J..

[6]  Richard R. Muntz,et al.  Generalized data stream indexing and temporal query processing , 1992, [1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing.

[7]  Yannis Manolopoulos,et al.  Processing of Spatio-Temporal Queries in Image Databases , 1999, ADBIS.

[8]  Georgios Evangelidis,et al.  The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation , 1995, VLDB.

[9]  Bernd-Uwe Pagel,et al.  Towards an analysis of range query performance in spatial data structures , 1993, PODS '93.

[10]  Amit P. Sheth,et al.  Changing Focus on Interoperability in Information Systems:From System, Syntax, Structure to Semantics , 1999 .

[11]  Jeffrey Scott Vitter,et al.  Efficient searching with linear constraints , 1998, J. Comput. Syst. Sci..

[12]  Marja-Riitta Koivunen,et al.  Annotea: an open RDF infrastructure for shared Web annotations , 2001, WWW '01.

[13]  Christian S. Jensen,et al.  On the Semantics of , 1996 .

[14]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[15]  Yufei Tao,et al.  MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries , 2001, VLDB.

[16]  Amit P. Sheth,et al.  Amicalola report: database and information systems research challenges and opportunities in semantic web and enterprises , 2002, SGMD.

[17]  P. Libby.  The Scientific American , 1881, Nature.

[18]  Franz Baader,et al.  An Overview of Tableau Algorithms for Description Logics , 2001, Stud Logica.

[19]  Nick Roussopoulos,et al.  Hashing Moving Objects , 2001, Mobile Data Management.

[20]  Jonathan Goldstein,et al.  Processing queries by linear constraints , 1997, PODS '97.

[21]  Christian S. Jensen,et al.  Indexing of moving objects for location-based services , 2002, Proceedings 18th International Conference on Data Engineering.

[22]  Olivier Devillers,et al.  Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points , 1994, CCCG.

[23]  Bernhard Seeger,et al.  An asymptotically optimal multiversion B-tree , 1996, The VLDB Journal.

[24]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[25]  Bernard Chazelle,et al.  Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine , 1992, ICALP.

[26]  Jeffrey F. Naughton,et al.  Generalized Search Trees for Database Systems , 1995, VLDB.

[27]  Kyuseok Shim,et al.  Fast Similarity Search in the Presence of Noise, Scaling, and Translation in Time-Series Databases , 1995, VLDB.

[28]  James D. Carswell.  Digital Image Retrieval using Shape-based Queries , 1998 .

[29]  Jan Chomicki,et al.  Constraint-based Interoperability of Spatiotemporal Databases* , 1999, GeoInformatica.

[30]  Jan Chomicki,et al.  A geometric framework for specifying spatiotemporal objects , 1999, Proceedings. Sixth International Workshop on Temporal Representation and Reasoning. TIME-99.

[31]  James A. Hendler,et al.  The Semantic Web: A new form of Web content that is meaningful to computers will unleash a revolution of new possibilities , 2001 .

[32]  Yufei Tao,et al.  Efficient historical R-trees , 2001, Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001.

[33]  Mengchu Cai,et al.  Parametric R-Tree: An Index Structure for Moving Objects , 2000 .

[34]  Timos K. Sellis,et al.  Specifications for efficient indexing in spatiotemporal databases , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[35]  Dimitrios Gunopulos,et al.  On indexing mobile objects , 1999, PODS '99.

[36]  Timos K. Sellis,et al.  Spatio-temporal indexing for large multimedia applications , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[37]  Ramesh C. Jain,et al.  Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[38]  Dimitrios Gunopulos,et al.  Finding Similar Time Series , 1997, PKDD.

[39]  Amit P. Sheth,et al.  Semantic Enhancement Engine: A Modular Document Enhancement Platform for Semantic Applications over Heterogeneous Content , 2002 .

[40]  Oliver Günther,et al.  The design of the cell tree: an object-oriented index structure for geometric databases , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[41]  Walid G. Aref,et al.  Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects , 2002, IEEE Trans. Computers.

[42]  Yannis Theodoridis,et al.  Evaluation of Access Structures for Discretely Moving Points , 1999, Spatio-Temporal Database Management.

[43]  Roy Ladner,et al.  The 2-3TR-tree, a trajectory-oriented index structure for fully evolving valid-time spatio-temporal datasets , 2002, GIS '02.

[44]  Arie Segev,et al.  A consensus glossary of temporal database concepts , 1994, SIGMOD 1994.

[45]  Michael F. Worboys,et al.  A Unified Model for Spatial and Temporal Information , 1994, Comput. J..

[46]  Hanan Samet,et al.  A consistent hierarchical representation for vector data , 1986, SIGGRAPH.

[47]  Ralf Hartmut Güting,et al.  Abstract and discrete modeling of spatio-temporal data types , 1998, GIS '98.

[48]  Dimitrios Gunopulos,et al.  Indexing Animated Objects , 1999, Multimedia Information Systems.

[49]  Jimeng Sun,et al.  The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries , 2003, VLDB.

[50]  Christian S. Jensen,et al.  Temporal Data Management , 1999, IEEE Trans. Knowl. Data Eng..

[51]  Jignesh M. Patel,et al.  Indexing Large Trajectory Data Sets With SETI , 2003, CIDR.

[52]  Ramez Elmasri,et al.  The Time Index: An Access Structure for Temporal Data , 1990, VLDB.

[53]  Christian S. Jensen,et al.  On the semantics of “now” in databases , 1996, TODS.

[54]  Jirí Matousek,et al.  Geometric range searching , 1994, CSUR.

[55]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[56]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[57]  Asunción Gómez-Pérez,et al.  An overview of methods and tools for ontology learning from texts , 2004, The Knowledge Engineering Review.

[58]  Mong-Li Lee,et al.  Supporting Frequent Updates in R-Trees: A Bottom-Up Approach , 2003, VLDB.

[59]  Sridhar Ramaswamy,et al.  The P-range tree: a new data structure for range searching in secondary memory , 1995, SODA '95.

[60]  Bo Xu,et al.  Moving objects databases: issues and solutions , 1998, Proceedings. Tenth International Conference on Scientific and Statistical Database Management (Cat. No.98TB100243).

[61]  Christian S. Jensen,et al.  Indexing the Positions of Continuously Moving Objects , 2000, SIGMOD Conference.

[62]  Laks V. S. Lakshmanan,et al.  ProbView: a flexible probabilistic database system , 1997, TODS.

[63]  Daniele Nardi,et al.  An Introduction to Description Logics , 2003, Description Logic Handbook.

[64]  Mark Fisher,et al.  Semantic Enterprise Content Management , 2004, The Practical Handbook of Internet Computing.

[65]  Christos H. Papadimitriou,et al.  On the analysis of indexing schemes , 1997, PODS '97.

[66]  Amit P. Sheth,et al.  Semantic Association Identification and Knowledge Discovery for National Security Applications , 2005, J. Database Manag..

[67]  Mario A. Nascimento,et al.  Towards historical R-trees , 1998, SAC '98.

[68]  Sridhar Ramaswamy.  Efficient Indexing for Constraint and Temporal Databases , 1997, ICDT.

[69]  Leonidas J. Guibas,et al.  Data Structures for Mobile Data , 1997, J. Algorithms.

[70]  Jeffrey Scott Vitter,et al.  Optimal dynamic interval management in external memory , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[71]  Shin'ichi Satoh,et al.  The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.

[72]  Yannis Manolopoulos,et al.  Overlapping linear quadtrees: a spatio-temporal access method , 1998, GIS '98.

[73]  Steffen Staab,et al.  On deep annotation , 2003, WWW '03.

[74]  Jirí Matousek,et al.  Efficient partition trees , 1991, SCG '91.

[75]  Steffen Schulze-Kremer,et al.  Ontologies for molecular biology and bioinformatics , 2002, Silico Biol..

[76]  Christos Faloutsos,et al.  Designing Access Methods for Bitemporal Databases , 1998, IEEE Trans. Knowl. Data Eng..

[77]  Divyakant Agrawal,et al.  Storage and Retrieval of Moving Objects , 2001, Mobile Data Management.

[78]  Sukho Lee,et al.  Indexing the current positions of moving objects using the lazy update R-tree , 2002, Proceedings Third International Conference on Mobile Data Management MDM 2002.

[79]  Alok Sinha.  Client-server computing , 1992, CACM.

[80]  Alberto O. Mendelzon,et al.  Similarity-based queries for time series data , 1997, SIGMOD '97.

[81]  Christos Faloutsos,et al.  On packing R-trees , 1993, CIKM '93.

[82]  Özgür Ulusoy,et al.  A Quadtree-Based Dynamic Attribute Indexing Method , 1998, Comput. J..

[83]  Eric Mays,et al.  Fully persistent B+-trees , 1991, SIGMOD '91.

[84]  Ramanathan V. Guha,et al.  SemTag and seeker: bootstrapping the semantic web via automated semantic annotation , 2003, WWW '03.

[85]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.

[86]  Amit P. Sheth,et al.  Semantic Content Management for Enterprises and the Web , 2001 .

[87]  Dimitrios Gunopulos,et al.  Efficient Indexing of Spatiotemporal Objects , 2002, EDBT.

[88]  Hans-Peter Kriegel,et al.  The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.

[89]  Peter Widmayer,et al.  The LSD tree: spatial access to multidimensional and non-point objects , 1989, VLDB 1989.

[90]  Nick Roussopoulos,et al.  SEB-tree: An Approach to Index Continuously Moving Objects , 2003, Mobile Data Management.

[91]  Walid G. Aref,et al.  SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees , 2001, Journal of Intelligent Information Systems.

[92]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

[93]  A. Prasad Sistla,et al.  Modeling and querying moving objects , 1997, Proceedings 13th International Conference on Data Engineering.

[94]  Ouri Wolfson,et al.  Cost and imprecision in modeling the position of moving objects , 1998, Proceedings 14th International Conference on Data Engineering.

[95]  John Townley.  The Streaming Search Engine That Reads Your Mind , 2005 .

[96]  Sharad Mehrotra,et al.  Querying Mobile Objects in Spatio-Temporal Databases , 2001, SSTD.

[97]  H. V. Jagadish,et al.  On Indexing Line Segments , 1990, VLDB.

[98]  Leandros Tassiulas,et al.  Broadcast scheduling for information distribution , 1999, Wirel. Networks.

[99]  Pankaj K. Agarwal,et al.  Indexing Moving Points , 2003, J. Comput. Syst. Sci..

[100]  Pankaj K. Agarwal,et al.  STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects , 2002, ALENEX.

[101]  Christos Faloutsos,et al.  Fast subsequence matching in time-series databases , 1994, SIGMOD '94.

[102]  Max J. Egenhofer,et al.  What's special about spatial?: database requirements for vehicle navigation in geographic space , 1993, SIGMOD Conference.

[103]  Dimitrios Gunopulos,et al.  Nearest Neighbor Queries in a Mobile Environment , 1999, Spatio-Temporal Database Management.

[104]  Tomasz Imielinski,et al.  Querying in Highly Mobile Distributed Environments , 1992, VLDB.

[105]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.