Member Login

E-mail:    Password:  




 TitleDate AddedCompany
whitepaper The Unique Challenges Facing the IT Professional in K-12 Education2008-03-01 SchoolDude.com
  How does your school or district stack up vs. peer institutions? Download this recent research report to see the results of a survey that identified key issues and trends among K-12 IT leaders: You will learn:
  • Top issues associated with managing IT in schools
  • Avg. staffing levels in various size districts
  • Peer views on security, IT integration, and budgeting
  • Mega-trend info. on issues such as SIF, SaaS/on-demand software, data-driven decision making, and NCLB's effect on IT strategy
  • How to combat the challenge of "too much IT stuff and not enough IT staff"


Tags: Database Management, Network Security, Resources Mgmt., IT Reliability		   
whitepaper Ruby Comes to the .NET Platform: Find Out Why .NET Programmers May Want to Learn and Use Ruby, and Discover the Core Syntax of the Language2008-10-20 JupiterMedia
  Microsoft's IronRuby project brings a powerful and fun dynamic language to the Windows platform. The Ruby programming language is a modern, object-oriented scripting language, with a syntax inspired by languages such as Perl and Smalltalk. It was conceived by Yukihiro Matsumoto (aka "Matz"). In his words, Matz wanted a language that was "More powerful than Perl and more object-oriented than Python". The language is designed to feel natural; something Matz calls the "Principle of least surprise." Version 1.0 of the language was released in 1996. For several years, Ruby existed as a little-known scripting language that excelled in the tasks for which it was originally designed: manipulating data and environment with the least amount of effort.

Tags: .NET, Application Development		   
whitepaper XML Vectorization: A Column-Based XML Storage Model2008-10-20 University of Pennsylvania
  The usual method for storing tables in a relational database is to store each tuple contiguously in secondary storage. A simple alternative is to store the columns contiguously, so that a table is represented as a set of vectors all of the same length. It has been shown that such a representation performs well on queries requiring few columns. This paper reviews the shredding scheme used in XMill, an XML compressor, which represents the document structure by using a set of files, consisting of a file describing the structure, and files describing the character data to be found on designated paths (corresponding to the column data).

Tags: XML, Programming Languages		   
whitepaper Validating Constraints in XML2008-10-20 University of Pennsylvania
  The role of XML in data exchange is evolving from one of merely conveying the structure of data to one that also conveys its semantics. In particular, several proposals for key and foreign key constraints have recently appeared, and aspects of these proposals have been adopted within XMLSchema. Although several validators for XMLSchema appear to check for keys, relatively little attention has been paid to the general problem of how to check constraints in XML. This paper examines the problem of checking keys in XML documents and describes a native validator based on SAX.

Tags: XML		   
whitepaper Diverse Peer Selection in Collaborative Web Search2008-10-20 Association for Computing Machinery
  Effective peer selection for intelligent query routing is a challenge in collaborative peer-based Web search systems, especially unstructured networks that do not have any centralized control of peer document collections. In particular, routing a query to multiple peers that provide the same results is a waste of resources. To deal with overlapping document collections the paper proposes a diverse peer selection approach for adaptive query routing. This approach takes into account not only which neighbors are the best resource providers for a given query, but also which combinations of neighbors can provide the least redundant results. The paper validates the feasibility of the proposed algorithm by presenting several simulation experiments conducted with different configurations of peer network environments.

Tags: Search Strategies		   
whitepaper Reasoning About Keys for XML2008-10-19 University of Pennsylvania
  This paper studies absolute and relative keys for XML, and investigates their associated decision problems. It is argued that these keys are important to many forms of hierarchically structured data including XML documents. In contrast to other proposals of keys for XML, these keys can be reasoned about efficiently. The paper shows that the (finite) satisfiability problem for these keys is trivial, and their (finite) implication problem is finitely axiomatizable and decidable in PTIME in the size of keys.

Tags: Programming Languages		   
whitepaper L-Tree: A Dynamic Labeling Structure for Ordered XML Data2008-10-19 IBM
  With the ever growing use of XML as a data representation format, an increasing need can be seen for robust, high performance XML database systems. While most of the work focuses on efficient XML query processing, XML databases also need to support efficient updates. To speed up query processing, various labeling schemes have been proposed. However, the vast majority of these schemes have poor update performance. This paper introduces a dynamic labeling structure for XML data: L-Tree and its order-preserving labeling scheme with O(log n) amortized update cost and O(log n) bits per label. L-Tree has good performance on updates without compromising the performance of query processing. The paper presents the update algorithm for L-Tree and analyzes its complexity.

Tags: XML, Database Management		   
whitepaper Reformulation of XML Queries and Constraints2008-10-18 University of California
  The authors state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redundancies (materialized views, indexes and caches) to enhance performance. The correspondence between published and proprietary schemas is specified by views in both directions, and the same algorithm performs rewriting-with-views, composition-with-views, or the combined effect of both, unifying the Global-As-View and Local-As-View approaches to data integration. The authors prove a completeness theorem which guarantees that under certain conditions, the algorithm will find a minimal reformulation if one exists.

Tags: Programming Languages, Software Engineering		   
whitepaper Querying XML With Mixed and Redundant Storage2008-10-18 University of Pennsylvania
  This paper examines some of the issues that arise in the process of XML publishing of mixed-storage proprietary data. It is argued that such data will reside typically in RDBMS's and/or LDAP, etc, augmented with a set of native XML documents. An additional challenge is to take advantage of redundancy in the storage schema, such as mixed materialized views that are stored for the purpose of enhancing performance. The authors argue that such systems need to take into consideration mappings in both directions between the proprietary schema and the published schema. Thus, reformulating queries on the (published) XML schema into executable queries on the stored data will require the effect of both composition-with-views (as in SilkRoute and XPERANTO) and rewriting-with-views (as in the Information Manifold and Agora).

Tags: Programming Languages, XML		   
whitepaper Using XQuery to Build Updatable XML Views Over Relational Databases2008-10-18 University of Pennsylvania
  XML has become an important medium for data exchange, and is frequently used as an interface to - i.e. a view of - a relational database. Although much attention has been paid to the problem of querying relational databases through XML views, the problem of updating relational databases through XML views has not been addressed. In this paper the authors investigate how a subset of XQuery can be used to build updatable XML views, so that an update to the view can be unambiguously translated to a set of updates on the underlying relational database, assuming that certain key and foreign key constraints hold. In particular, the authors show how views defined in this subset of XQuery can be mapped to a set of relational views.

Tags: Database Management, XML		   


Recognizing technology companies that matter

ZDNet Asia Top Tech Index

Find out who you should be spending your IT budget with