[go: up one dir, main page]

Lawson et al. - Google Patents

ARCHITECTING E-BUSINESS INFRASTRUCTURE

Lawson et al.

Document ID
3419490361654888506
Author
Lawson V
Wietrzyk I
Grosky B

External Links

Snippet

ARCHITECTING E-BUSINESS INFRASTRUCTURE Vlad Ingar Wietrzyk Robyn Lawson School of Computing and Information Technology University of Western Sydney Australia Ingrid Wietrzyk Best and Less Pty Ltd Sydney Australia Bill Grosky University of Michigan Dearborn …
Continue reading at www.actapress.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G06F17/30424—Query processing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30575—Replication, distribution or synchronisation of data between databases or within a distributed database; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
    • G06F12/0806—Multiuser, multiprocessor or multiprocessing cache systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30067—File systems; File servers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F12/00—Accessing, addressing or allocating within memory systems or architectures
    • G06F12/02—Addressing or allocation; Relocation
    • G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
    • G06F12/12—Replacement control
    • G06F12/121—Replacement control using replacement algorithms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity

Similar Documents

Publication Publication Date Title
US9489443B1 (en) Scheduling of splits and moves of database partitions
US9971823B2 (en) Dynamic replica failure detection and healing
US9317469B2 (en) Network with distributed shared memory
US9246776B2 (en) Forward-based resource delivery network management techniques
US5924096A (en) Distributed database using indexed into tags to tracks events according to type, update cache, create virtual update log on demand
US12235874B2 (en) Cross-organization and cross-cloud automated data pipelines
US8849793B2 (en) Devices for providing distributable middleware data proxy between application servers and database servers
EP0976065B1 (en) Dynamic directory service
US8903769B2 (en) Adaptive edge processing of application data
US20090144388A1 (en) Network with distributed shared memory
US20080256090A1 (en) Dynamic directory service
CN114207601B (en) Managing objects in a shared cache using multiple chains
Cao et al. Is-hbase: An in-storage computing optimized hbase with i/o offloading and self-adaptive caching in compute-storage disaggregated infrastructure
US8560521B2 (en) System, method, and computer program product for processing a prefix tree file utilizing a selected agent
US20070214109A1 (en) Enforcement of service terms through adaptive edge processing of application data
Li et al. Replichard: Towards tradeoff between consistency and performance for metadata
Lawson et al. ARCHITECTING E-BUSINESS INFRASTRUCTURE
Nwe et al. A consistent replica selection approach for distributed key-value storage system
Aznar-Poveda et al. SDKV: A smart and distributed key-value store for the edge-cloud continuum
Deniel et al. GANESHA, a multi-usage with large cache NFSv4 server
Huang et al. Cheap recovery: A key to self-managing state
Pang et al. Defragmenting DHT-based distributed file systems
Stamos et al. Caching techniques on CDN simulated frameworks
Shevarev et al. Dynamic Content-Oriented Indexing and Replication for High-Performance Storage and Analysis of Big Data in the IPFS Network
Fathima et al. ARCHITECTING THE DATASTORE FOR THE URL FRONTIER OF OPENWEBSEARCH. EU