Developement
Inserting data into a data-only-locked heap table
0When users insert data into a data-only-locked heap table, Adaptive Server tracks page numbers where the inserts have recently occurred, and keeps the page number as a hint for future tasks that need space. Subsequent inserts to the table are directed to one of these pages. If the page is full, Adaptive Server allocates a new page and replaces the old hint with the new page number.
/***********************************************************************************************************
Blocking while many users are simultaneously inserting data is much less likely to occur during inserts to data-only-locked heap tables. When blocking occurs, Adaptive Server allocates a small number of empty pages
and directs new inserts to those pages using these newly allocated pages as hints.
**********************************************************************************************************/
For datarows-locked tables, blocking occurs only while the actual changes to the data page are being written; although row locks are held for the duration of the transaction, other rows can be inserted on the page. The row-level locks allow multiple transaction to hold locks on the page.
If conflicts occur during heap inserts
————————————–
Conflicts during inserts to heap tables are greatly reduced for data-onlylocked tables, but can still take place. If these conflicts slow inserts, some workarounds can be used, including:
• Switching to datarows locking, if the table uses datapages locking
• Using a clustered index to spread data inserts
• Partitioning the table, which provides additional hints and allows new pages to be allocated on each partition when blocking takes place
Inserting data into an allpages-locked heap table
0When you insert data into an allpages-locked heap table, the data row is always added to the last page of the table. If there is no clustered index on a table, and the table is not partitioned, the sysindexes.root entry for the heap table stores a pointer to the last page of the heap to locate the page
where the data needs to be inserted.
If the last page is full, a new page is allocated in the current extent and linked onto the chain. If the extent is full, Adaptive Server looks for empty pages on other extents being used by the table. If no pages are available, a new extent is allocated to the table.
Conflicts during heap inserts
—————————-
If many users are trying to insert into an allpages-locked heap table at the same time, each insert must
wait for the preceding transaction to complete.
This problem of last-page conflicts on heaps is true for:
• Single row inserts using insert
• Multiple row inserts using select into or insert…select, or several insert statements in a batch
• Bulk copy into the table
Some workarounds for last-page conflicts on heaps include:
———————————————————
• Switching to datapages or datarows locking
• Creating a clustered index that directs the inserts to different pages
• Partitioning the table, which creates multiple insert points for the table, giving you multiple “last pages” in an allpages-locked table
Guidelines for improving I/O performance
0The major guidelines for improving I/O performance in Adaptive Server are as follows:
• Spreading data across disks to avoid I/O contention.
• Isolating server-wide I/O from database I/O.
• Separating data storage and log storage for frequently updated databases.
• Keeping random disk I/O away from sequential disk I/O.
• Mirroring devices on separate physical disks.
• Partitioning tables to match the number of physical devices in a segment.
Logical or Database Devices and Physical Devices
0Distinctions between logical or database devices and physical devices:
———————————————————————-
• The physical disk or physical device is the actual hardware that stores the data.
• A database device or logical device is a piece of a physical disk that has been initialized (with the disk init command) for use by Adaptive Server. A database device can be an operating system file, an entire disk, or a disk partition.
• A segment is a named collection of database devices used by a database. The database devices that make up a segment can be located on separate physical devices.
• A partition is block of storage for a table. Partitioning a table splits it so that multiple tasks can access it simultaneously. When partitioned tables are placed on segments with a matching number of devices, each partition starts on a separate database device.
sp_helpdevice –> To get information about devices
sp_helpsegment –> To get information about segments
sp_helpartition –> To get information about partitions.
What’s in YOUR Architecture?
0What’s in your architecture?
Probably not enough if you’re using just data modeling to integrate all the components of your enterprise, especially your information. To lay the
foundation of this paper, let’s start from the same level of understanding: the need for a common approach to managing all the aspects of information to
enable rapid business performance in the 21st century economy.
Competition in the marketplace is always fierce. To stay abreast, organizations must constantly analyze their customer needs and expectations, enhance
or innovate their business processes, and deliver products and services that create exceptional customer value. Organizations also need to be customercentric to forge long-term relationships with clients and consumers. Only organizations that are agile enough to respond to volatile market conditions
with innovation, expedited time-to-market processes, and reduced costs can differentiate themselves from the competition. Such agility occurs when a
company’s IT operations are closely aligned with its business operations. IT needs to understand business to implement technologies and applications that
support the current and future business goals.
Read Full Article @ http://www.sybase.com/files/White_Papers/Sybase_Whats_in_Your_Architecture_WP.pdf
How to run sybase query in different databases in one run
0I would suggest to run SQL via shell script as below.
database.txt
————
database1
database2
database3
query.txt
———
select col1, col2 from table
go
write shell script
multiple_database_query.sh
————————–
while read LINE
do
database=$LINE
isql -S “” -D “${database}” -i “query.txt”
done < database.txt
Database load error
0Sometime “database is in use” error encounters while loading the database, this could be due to in-memory db tables might still active for the named database. So use the dbcc commands to clear those and reload the database.
How to know what are the spids using given database
0Use below command
dbcc dbreboot(‘report’,'dbname’)
go
It will give you all spids which are using given database.
How to remove duplicate rows from a file in unix
0use
cat <filename> | sort | uniq -c
Note: “sort” command is required before “uniq” because uniq command matches the next line with previous one. If file is not sorted then duplicate rows unlikely be filtered.
“Pushd, popd and cd -” unix commands
0pushd:- This command acts similar to “cd” command.
popd:- This command is used to return to previous directory.
cd -:- This command is also used to return to previous directory.
NOTE Both “popd” and “cd -” works similar but they differ primarily that “cd -” acts like a loop i.e.
cd - cd - cd - cd -
Directory X ——> Directory A ——–> Directory B ——-> Directory A ——–> B ——->A —–> B
However,
popd popd
Directory X ——> Directory A —> Directory B ——-> A———> X
Recent Comments